The de Bruijn-Erdős theorem for hypergraphs

DOI10.1007/s10623-011-9555-4zbMath1254.05026arXiv1007.4150OpenAlexW2073991679MaRDI QIDQ690671

Dhruv Mubayi, Keith E. Mellinger, Noga Alon, Jacques Verstraete

Publication date: 28 November 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

Zarankiewicz problemminimum size of a clique partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65)

Related Items (5)

Some remarks on the Zarankiewicz problem ⋮ Independent sets in hypergraphs omitting an intersection ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Exact values for some unbalanced Zarankiewicz numbers ⋮ Lines in hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof of Totten's classification of restricted linear spaces
• On decompositions of complete hypergraphs
• Ovoides et groupes de Suzuki
• On t-designs
• Norm-graphs: Variations and applications
• The affine plane \(AG(2,q)\), \(q\) odd, has a unique one point extension
• Decomposition of the complete r-graph into complete r-partite r-graphs
• New asymptotics for bipartite Turán numbers
• A counting proof of the Graham-Pollak theorem
• Exact Covering Configurations and Steiner Systems
• The Search for a Finite Projective Plane of Order 10
• Inversive planes of even order
• On Finite Inversive Planes
• On the Addressing Problem for Loop Switching
• On a problem of K. Zarankiewicz
• Ovals In a Finite Projective Plane

This page was built for publication: The de Bruijn-Erdős theorem for hypergraphs