Coloring cross-intersecting families

zbMATH Open1390.05232arXiv1707.04539MaRDI QIDQ1753012FDOQ1753012

Authors: Danila Cherkashin 

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• Counting intersecting and pairs of cross-intersecting families
• Uniform s-Cross-Intersecting Families
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• Colourings without monochromatic disjoint pairs

zbMATH Keywords

intersecting familycross-intersecting familyhypergraphs colorings

Mathematics Subject Classification ID

Extremal set theory (05D05)

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Constructions of sparse uniform hypergraphs with high chromatic number
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Title not available (Why is that?)
• Top-down lower bounds for depth-three circuits
• Covers in uniform intersecting families and a counterexample to a conjecture of Lovász
• Improved bounds and algorithms for hypergraph 2-coloring
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• A note on random greedy coloring of uniform hypergraphs
• On a combinatorial problem. II
• The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
• An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
• On hypergraph cliques with chromatic number 3
• Regular bipartite graphs and intersecting families

Cited In (5)

• Chromatic numbers of Kneser-type graphs
• Extremal problems in hypergraph colourings
• A coloring problem for intersecting vector spaces
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On the chromatic numbers of some distance graphs

This page was built for publication: Coloring cross-intersecting families

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