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

Zoltán Szabó

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 (27)

A blurred view of Van der Waerden type theoremsOn general two-colorings of uniform hypergraphsExtremal problems for colorings of simple hypergraphs and applicationsMultipass greedy coloring of simple uniform hypergraphsOn the lower bound for the van der Waerden functionLower bounds in the combinatorial problem of Erdős and LovászVan der Waerden function and colorings of hypergraphs with large girthOn some generalizations of the property B problem of an \(n\)-uniform hypergraphMonochromatic Hilbert cubes and arithmetic progressionsColorings of \(b\)-simple hypergraphsDP-colorings of hypergraphsImproved algorithms for colorings of simple hypergraphs and applications2-colorings of hypergraphs with large girthExtremal problems in hypergraph colouringsOn the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász local lemmaCombinatorial extremum problems for 2-colorings of hypergraphsOn \(r\)-chromatic hypergraphsColourings of Uniform Hypergraphs with Large Girth and ApplicationsAn estimate for the probability of dependent eventsUsing the incompressibility method to obtain local Lemma results for Ramsey-type problemsA lower bound for off-diagonal van der Waerden numbersOn proper colourings of hypergraphs using prescribed coloursA subexponential upper bound for van der Waerden numbers \(W(3,k)\)Colorings of partial Steiner systems and their applicationsOn the chromatic number of simple triangle-free triple systemsRandom coloring method in the combinatorial problem of Erdős and LovászNew lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)




Cites Work




This page was built for publication: An application of Lovász' local lemma-A new lower bound for the van der Waerden number