The intersection spectrum of 3-chromatic intersecting hypergraphs

DOI10.1007/978-3-030-83823-2_22MaRDI QIDQ6604685zbMATH OpenFDO

Authors Matija Bucić, Stefan Glock, Benny Sudakov

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-3-030-83823-2_22

zbMATH Keywords

intersecting hypergraphsintersection spectrumproperty B

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• Concerning biconnected sets.
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Extremal problems in hypergraph colourings
• scientific article; zbMATH DE number 3754700 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 1317271 (Why is no real title available?)
• scientific article; zbMATH DE number 736294 (Why is no real title available?)
• scientific article; zbMATH DE number 3414305 (Why is no real title available?)
• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• scientific article; zbMATH DE number 3027841 (Why is no real title available?)
• Invitation to intersection problems for finite sets
• On 3-chromatic hypergraphs
• On a Combinatorial Problem of Erdös and Hajnal
• On a combinatorial problem of P. Erdős and L. Lovasz
• On a Problem of Erdos and Lovasz. II: n(r) = O(r)
• On a problem of Erdős and Lovász: Random lines in a projective plane
• On a property of families of sets
• On graphs with small Ramsey numbers
• On the construction of 3-chromatic hypergraphs with few edges
• Problems and results in discrete mathematics
• The probabilistic method
• Zur Theorie der trigonometrischen Reihe.

This page was built for publication: The intersection spectrum of 3-chromatic intersecting hypergraphs

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