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...
| Main Authors: | , |
|---|---|
| Format: | Journal 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 |
| _version_ | 1811694845175005184 |
|---|---|
| author | Ling, Alan C. H. Chee, Yeow Meng |
| author_facet | Ling, Alan C. H. Chee, Yeow Meng |
| author_sort | Ling, Alan C. H. |
| collection | NTU |
| description | 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 hypergraphs, except for those equivalent to the classical Turán numbers. In this paper, we determine the size of extremal k-uniform hypergraphs containing at most one pair of 2-intersecting edges for k ∈ {3, 4}. We give a complete solution when k = 3 and an almost complete solution (with eleven exceptions) when k = 4. |
| first_indexed | 2024-10-01T07:14:02Z |
| format | Journal Article |
| id | ntu-10356/91229 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:14:02Z |
| publishDate | 2009 |
| record_format | dspace |
| spelling | ntu-10356/912292023-02-28T19:35:52Z On extremal k-graphs without repeated copies of 2-intersecting edges Ling, Alan C. H. Chee, Yeow Meng DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics 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 hypergraphs, except for those equivalent to the classical Turán numbers. In this paper, we determine the size of extremal k-uniform hypergraphs containing at most one pair of 2-intersecting edges for k ∈ {3, 4}. We give a complete solution when k = 3 and an almost complete solution (with eleven exceptions) when k = 4. Published version 2009-08-11T06:38:26Z 2019-12-06T18:01:59Z 2009-08-11T06:38:26Z 2019-12-06T18:01:59Z 2007 2007 Journal Article Chee, Y. M., & Ling, A. C. H. (2007). On extremal k-graphs without repeated copies of 2-intersecting edges. Siam Journal on Discrete Mathematics, 21(3), 805–821. 0895-4801 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 10.1137/060675915 en Siam journal on discrete mathematics SIAM Journal on Discrete Mathematics @ copyright Society for Industrial and Applied Mathematics. The journal website is located at http://www.siam.org/journals/sidma.php. 17 p. application/pdf |
| spellingShingle | DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics Ling, Alan C. H. Chee, Yeow Meng On extremal k-graphs without repeated copies of 2-intersecting edges |
| title | On extremal k-graphs without repeated copies of 2-intersecting edges |
| title_full | On extremal k-graphs without repeated copies of 2-intersecting edges |
| title_fullStr | On extremal k-graphs without repeated copies of 2-intersecting edges |
| title_full_unstemmed | On extremal k-graphs without repeated copies of 2-intersecting edges |
| title_short | On extremal k-graphs without repeated copies of 2-intersecting edges |
| title_sort | on extremal k graphs without repeated copies of 2 intersecting edges |
| topic | DRNTU::Science::Mathematics::Discrete mathematics::Combinatorics |
| url | 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 |
| work_keys_str_mv | AT lingalanch onextremalkgraphswithoutrepeatedcopiesof2intersectingedges AT cheeyeowmeng onextremalkgraphswithoutrepeatedcopiesof2intersectingedges |