A note on Huang-Zhao theorem on intersecting families with large minimum degree

DOI10.1016/j.disc.2016.10.011zbMath1357.05064OpenAlexW2549354374MaRDI QIDQ512607

Norihide Tokushige, Peter Frankl

Publication date: 27 February 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.10.011

zbMATH Keywords

Erdős-Ko-Rado theoremKneser graphHoffman's bound

Mathematics Subject Classification ID

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

Related Items (6)

Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ A degree version of the Hilton-Milner theorem ⋮ Degree versions of theorems on intersecting families via stability ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree

Cites Work

• The eigenvalue method for cross \(t\)-intersecting families
• The Erdős-Ko-Rado theorem for vector spaces
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
• Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs

This page was built for publication: A note on Huang-Zhao theorem on intersecting families with large minimum degree