An application of Lovász' local lemma-A new lower bound for the van der Waerden number
From MaRDI portal
Publication:3211360
DOI10.1002/rsa.3240010307zbMath0723.05115WikidataQ125065954 ScholiaQ125065954MaRDI QIDQ3211360
Publication date: 1990
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240010307
Related Items
Colourings of Uniform Hypergraphs with Large Girth and Applications, Extremal problems in hypergraph colourings, A blurred view of Van der Waerden type theorems, Extremal problems for colorings of simple hypergraphs and applications, On the lower bound for the van der Waerden function, Van der Waerden function and colorings of hypergraphs with large girth, Lower bounds in the combinatorial problem of Erdős and Lovász, On \(r\)-chromatic hypergraphs, On general two-colorings of uniform hypergraphs, Improved algorithms for colorings of simple hypergraphs and applications, An estimate for the probability of dependent events, Using the incompressibility method to obtain local Lemma results for Ramsey-type problems, On the chromatic number of simple triangle-free triple systems, Colorings of \(b\)-simple hypergraphs, On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma, A subexponential upper bound for van der Waerden numbers \(W(3,k)\), New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\), 2-colorings of hypergraphs with large girth, A lower bound for off-diagonal van der Waerden numbers, Monochromatic Hilbert cubes and arithmetic progressions, DP-colorings of hypergraphs, Combinatorial extremum problems for 2-colorings of hypergraphs, Colorings of partial Steiner systems and their applications, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, On proper colourings of hypergraphs using prescribed colours, Random coloring method in the combinatorial problem of Erdős and Lovász, Multipass greedy coloring of simple uniform hypergraphs
Cites Work
