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

DOI10.1016/J.DISC.2016.10.011MaRDI QIDQ512607zbMATH OpenOpenAlexFDO

Authors Peter Frankl, Norihide Tokushige

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

Kneser graphHoffman's boundErdős-Ko-Rado theorem

Mathematics Subject Classification ID

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

Recommendations

• A degree version of the Hilton-Milner theorem
• Maximum size intersecting families of bounded minimum positive co-degree
• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
• Maximum degree and diversity in intersecting hypergraphs
• On t-Intersecting Hypergraphs with Minimum Positive Codegrees

Cites work

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

Cited in

(7)

• Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
• Degree versions of theorems on intersecting families via stability
• Maximum size intersecting families of bounded minimum positive co-degree
• The spectral radii of intersecting uniform hypergraphs
• A degree version of the Hilton-Milner theorem
• On t-Intersecting Hypergraphs with Minimum Positive Codegrees
• Shadows of 3-uniform hypergraphs under a minimum degree condition

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

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