On extremal k-graphs without repeated copies of 2-intersecting edges

The problem of determining extremal hypergraphs containing at most r isomorphic copies of some element of a given hypergraph family was first studied by Boros et al. in 2001. There are not many hypergraph families for which exact results are known concerning the size of the corresponding extremal hy...

Full description

Saved in:
Bibliographic Details
Main Authors: Ling, Alan C. H., Chee, Yeow Meng
Format: Article
Language:English
Published: 2009
Subjects:
Online Access:https://hdl.handle.net/10356/91229
http://hdl.handle.net/10220/6035
http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:ELSEVIER_SCOPUS&id=doi:&genre=&isbn=&issn=&date=2007&volume=21&issue=3&spage=805&epage=821&aulast=Chee&aufirst=%20Y%20M&auinit=&title=SIAM%20Journal%20on%20Discrete%20Mathematics&atitle=On%20extremal%20k%2Dgraphs%20without%20repeated%20copies%20of%202%2Dintersecting%20edges
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English