Independence numbers of hypergraphs with sparse neighborhoods.

DOI10.1016/j.ejc.2003.09.008zbMath1034.05038OpenAlexW1983851887MaRDI QIDQ1427433

Yusheng Li, Guo-fei Zhou

Publication date: 14 March 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.09.008

zbMATH Keywords

Lower bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Transversals and independence in linear hypergraphs with maximum degree two ⋮ On vertex independence number of uniform hypergraphs ⋮ Coloring the normalized Laplacian for oriented hypergraphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3

Cites Work

• Unnamed Item
• An upper bound on the Ramsey numbers R(3,k)
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• On Turan's theorem for sparse graphs
• Ramsey numbers involving large dense graphs and bipartite Turán numbers
• On book-complete graph Ramsey numbers
• Improved lower bounds on k‐independence
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Asymptotic upper bounds for Ramsey functions

This page was built for publication: Independence numbers of hypergraphs with sparse neighborhoods.