Coloring Cross-Intersecting Families

@article{Cherkashin2018ColoringCF,
  title={Coloring Cross-Intersecting Families},
  author={D. Cherkashin},
  journal={Electron. J. Comb.},
  year={2018},
  volume={25},
  pages={P1.47}
}
  • D. Cherkashin
  • Published 2018
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erd{\H o}s--Ko--Rado theorem. On the other hand, P.~Erd{\H o}s and L.~Lov{\'a}sz in the noted paper~\cite{EL} posed problems on coloring intersecting families as a restriction of classical hypergraph coloring problems to a special class of hypergraphs. This note deals with the mentioned coloring problems stated for cross-intersecting families. 
    2 Citations

    Topics from this paper.

    Chromatic numbers of Kneser-type graphs
    • D. Zakharov
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. A
    • 2020

    References

    SHOWING 1-10 OF 15 REFERENCES
    Regular bipartite graphs and intersecting families
    • 21
    • PDF
    Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász
    • 25
    • PDF
    Improved bounds and algorithms for hypergraph two-coloring
    • J. Radhakrishnan, A. Srinivasan
    • Computer Science, Mathematics
    • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
    • 1998
    • 51
    • PDF
    Constructions of sparse uniform hypergraphs with high chromatic number
    • 26
    • PDF
    A note on random greedy coloring of uniform hypergraphs
    • 30
    • PDF
    An upper bound for the size of a k-uniform intersecting family with covering number k
    • 7
    • PDF
    A near exponential improvement on a bound of Erdős and Lovász
    • 2017
    • 2
    • PDF
    Erdös-Ko-Rado theorem with conditions on the maximal degree
    • P. Frankl
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. A
    • 1987
    • 60
    • PDF
    The exact bound in the Erdös-Ko-Rado theorem
    • 266