Coloring cross-intersecting families
From MaRDI portal
Publication:1753012
zbMath1390.05232arXiv1707.04539MaRDI QIDQ1753012
Publication date: 25 May 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.04539
Related Items (4)
Extremal problems in hypergraph colourings ⋮ On the chromatic numbers of some distance graphs ⋮ Chromatic numbers of Kneser-type graphs ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
Cites Work
- Unnamed Item
- On hypergraph cliques with chromatic number 3
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Regular bipartite graphs and intersecting families
- Top-down lower bounds for depth-three circuits
- Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
- Constructions of sparse uniform hypergraphs with high chromatic number
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A note on random greedy coloring of uniform hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a combinatorial problem. II
This page was built for publication: Coloring cross-intersecting families
