Improved bounds concerning the maximum degree of intersecting hypergraphs

DOI10.37236/11616zbMATH Open1543.0518MaRDI QIDQ6574372

Jian Wang, Peter Frankl

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Erdős-Ko-Rado theorem\(t\)-intersecting \(k\)-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The exact bound in the Erdős-Ko-Rado theorem
• On strengthenings of the intersecting shadow theorem
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• Intersections and distinct intersections in cross-intersecting families
• The size of a hypergraph and its matching number
• On r-Cross Intersecting Families of Sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• THE ERDÖS–KO–RADO THEOREM WITH VALENCY CONDITIONS
• Simple juntas for shifted families
• Intersection theorems for systems of finite sets
• On intersecting families of finite sets
• On the maximum of the sum of the sizes of non-trivial cross-intersecting families
• A product version of the Hilton-Milner-Frankl theorem

This page was built for publication: Improved bounds concerning the maximum degree of intersecting hypergraphs

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