On a Probabilistic Graph-Theoretical Method
From MaRDI portal
Publication:4182520
DOI10.2307/2042818zbMath0399.05007OpenAlexW4242046659MaRDI QIDQ4182520
Vojtěch Rödl, Jaroslav Nešetřil
Publication date: 1978
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2042818
Related Items
Ramsey properties for classes of relational systems ⋮ On ordered graphs and graph orderings ⋮ Characterization of diagrams by 0-1 inequalities ⋮ The Minimum Number of Edges in Uniform Hypergraphs with Property O ⋮ Searching for acyclic orientations of graphs ⋮ Negative results on characterizing visibility graphs ⋮ A non-covering graph of girth six ⋮ A Ramsey class for Steiner systems ⋮ Statistics of orderings ⋮ On subgraphs of \(C_{2k}\)-free graphs ⋮ A short proof of the induced Ramsey theorem for hypergraphs ⋮ Generalized Turán problems for even cycles ⋮ Amalgamation of matroids and its applications ⋮ Reorientations of covering graphs ⋮ Balanced graphs and noncovering graphs ⋮ Random orderings and unique ergodicity of automorphism groups ⋮ Ramsey properties and extending partial automorphisms forhbox classes of finite structures ⋮ Random graphs and covering graphs of posets ⋮ Ramsey varieties ⋮ The Ramsey and the ordering property for classes of lattices and semilattices ⋮ Invariant measures on products and on the space of linear orders ⋮ On subgraphs of C2k-free graphs and a problem of Kühn and Osthus ⋮ Embedding Graphs into Colored Graphs ⋮ Complexity of diagrams ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges
