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.05115OpenAlexW2074455580WikidataQ125065954 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
A blurred view of Van der Waerden type theorems, On general two-colorings of uniform hypergraphs, Extremal problems for colorings of simple hypergraphs and applications, Multipass greedy coloring of simple uniform hypergraphs, On the lower bound for the van der Waerden function, Lower bounds in the combinatorial problem of Erdős and Lovász, Van der Waerden function and colorings of hypergraphs with large girth, On some generalizations of the property B problem of an \(n\)-uniform hypergraph, Monochromatic Hilbert cubes and arithmetic progressions, Colorings of \(b\)-simple hypergraphs, DP-colorings of hypergraphs, Improved algorithms for colorings of simple hypergraphs and applications, 2-colorings of hypergraphs with large girth, Extremal problems in hypergraph colourings, On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemma, Combinatorial extremum problems for 2-colorings of hypergraphs, On \(r\)-chromatic hypergraphs, Colourings of Uniform Hypergraphs with Large Girth and Applications, An estimate for the probability of dependent events, Using the incompressibility method to obtain local Lemma results for Ramsey-type problems, A lower bound for off-diagonal van der Waerden numbers, On proper colourings of hypergraphs using prescribed colours, A subexponential upper bound for van der Waerden numbers \(W(3,k)\), Colorings of partial Steiner systems and their applications, On the chromatic number of simple triangle-free triple systems, Random coloring method in the combinatorial problem of Erdős and Lovász, New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
Cites Work
