Hypergraphs of Bounded Disjointness

DOI10.1137/130925670MaRDI QIDQ4979845zbMATH OpenOpenAlexFDO

Authors Elizabeth L. Wilmer, Alex Scott

Publication date 19 June 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.4236

zbMATH Keywords

\(s\)-almost intersecting familyextremal set theoryintersection theoremsmultihypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Abstract: A $k$-uniform hypergraph is $s$-almost intersecting if every edge is disjoint from exactly $s$ other edges. Gerbner, Lemons, Palmer, Patk'os and Sz'ecsi conjectured that for every $k$, and $s>s_0(k)$, every $k$-uniform $s$-almost intersecting hypergraph has at most $$ edges. We prove a strengthened version of this conjecture and determine the extremal graphs. We also give some related results and conjectures.

Recommendations

• Hypergraphs in which all disjoint pairs have distinct unions
• Disjoint edges in separated hypergraphs
• scientific article; zbMATH DE number 3933118
• scientific article; zbMATH DE number 781194
• Erdős-Hajnal-type theorems in hypergraphs
• Separation dimension of graphs and hypergraphs
• Connection and separation in hypergraphs
• On subgraphs of bounded degeneracy in hypergraphs
• Betti Numbers of Hypergraphs
• Bounds for the Graham-Pollak theorem for hypergraphs

Cited in

(17)

• A broken-circuits-theorem for hypergraphs
• On intersecting hypergraphs
• Disjointness in hypercyclicity
• Separable and equatable hypergraphs
• On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges
• Betti Numbers of Hypergraphs
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• Intersections of hypergraphs
• Circulant almost cross intersecting families
• no-homomorphism conditions for hypergraphs
• scientific article; zbMATH DE number 969103 (Why is no real title available?)
• Hypergraphs without non-trivial intersecting subgraphs
• Almost-Fisher families
• Uniform hypergraphs under certain intersection constraints between hyperedges
• s-almost cross-t-intersecting families for finite sets
• Extremal G-free induced subgraphs of Kneser graphs
• Exchangeable interval hypergraphs and limits of ordered discrete structures

This page was built for publication: Hypergraphs of Bounded Disjointness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979845)