The intersection spectrum of 3-chromatic intersecting hypergraphs
From MaRDI portal
Publication:6604685
DOI10.1007/978-3-030-83823-2_22MaRDI QIDQ6604685
Benny Sudakov, Stefan Glock, Matija Bucić
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Invitation to intersection problems for finite sets
- On 3-chromatic hypergraphs
- On a problem of Erdős and Lovász: Random lines in a projective plane
- On a combinatorial problem of P. Erdős and L. Lovasz
- Problems and results in discrete mathematics
- Zur Theorie der trigonometrischen Reihe.
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
- On the construction of 3-chromatic hypergraphs with few edges
- Concerning biconnected sets.
- On graphs with small Ramsey numbers
- The probabilistic method
- On a Problem of Erdos and Lovasz. II: n(r) = O(r)
- Extremal problems in hypergraph colourings
- On a Combinatorial Problem of Erdös and Hajnal
- On a property of families of sets
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)
