Abstract
AbstractA well-known observation of Lovász is that if a hypergraph is not 2-colourable, then at least one pair of its edges intersect at a single vertex. In this short paper we consider the quantitative version of Lovász’s criterion. That is, we ask how many pairs of edges intersecting at a single vertex should belong to a non-2-colourable n-uniform hypergraph. Our main result is an exact answer to this question, which further characterizes all the extremal hypergraphs. The proof combines Bollobás’s two families theorem with Pluhar’s randomized colouring algorithm.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference8 articles.
1. Zur Theorie der trigonometrische Reihen;Bernstein;Leipz. Ber.,1908
2. A note on random greedy coloring of uniform hypergraphs
3. ON THE TWO-COLOURING OF HYPERGRAPHS
4. On a property of families of sets;Miller;Comput. Rend. Varsovie,1937