Journal article
Hypergraphs of bounded disjointness
- Abstract:
- A κ-uniform hypergraph is s-almost intersecting if every edge is disjoint from exactly s other edges. Gerbner et al. [SIAM J. Discrete Math., 26 (2012), pp. 1657 1669] conjectured that for every κ, and s s0(κ), every k-uniform s-almost intersecting hypergraph has at most (s+1)(2k-2 k-1 edges. We prove a strengthened version of this conjecture and determine the extremal graphs. We also give some related results and conjectures.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 337.1KB, Terms of use)
-
- Publisher copy:
- 10.1137/130925670
Authors
- Publisher:
- Society for Industrial and Applied Mathematics
- Journal:
- SIAM Journal on Discrete Mathematics More from this journal
- Volume:
- 28
- Issue:
- 1
- Pages:
- 372-384
- Publication date:
- 2014-03-11
- Acceptance date:
- 2013-12-17
- DOI:
- EISSN:
-
1095-7146
- ISSN:
-
0895-4801
- Keywords:
- Pubs id:
-
pubs:464153
- UUID:
-
uuid:0cf0bea3-ff4a-4912-b1f5-db2ec930b451
- Local pid:
-
pubs:464153
- Source identifiers:
-
464153
- Deposit date:
-
2016-07-09
- ARK identifier:
Terms of use
- Copyright holder:
- Society for Industrial and Applied Mathematics
- Copyright date:
- 2014
- Notes:
-
This is an
accepted manuscript of a journal article published by Society for Industrial and Applied Mathematics in SIAM Journal on Discrete Mathematics on 2014-03-11, available online: http://dx.doi.org/10.1137/130925670
If you are the owner of this record, you can report an update to it here: Report update to this record