Asymptotic lower bounds for Ramsey functions
From MaRDI portal
Publication:1245976
DOI10.1016/0012-365X(77)90044-9zbMath0375.05033WikidataQ56565508 ScholiaQ56565508MaRDI QIDQ1245976
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies, Coloring Steiner Triple Systems, On the minimum degree of minimal Ramsey graphs for multiple colours, On Conflict-Free Multi-coloring, Probabilistic methods, A Ramsey problem of Harary on graphs with prescribed size, Tough Ramsey graphs without short cycles, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, First-fit colorings of graphs with no cycles of a prescribed even length, On Ramsey numbers of uniform hypergraphs with given maximum degree, On the Ramsey number \(r(H+\overline{K_ n},K_ n)\), ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS, SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY, Ramsey Size Linear Graphs, Rainbow Hamilton cycles and lopsidependency, Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques, Chain method for panchromatic colorings of hypergraphs, A note on the Erdős-Hajnal hypergraph Ramsey problem, An improved bound for the stepping-up lemma, A General Framework for Hypergraph Coloring, Packing nearly optimal Ramsey \(R(3,t)\) graphs, Counting Solutions to Random CNF Formulas, Erdős-Hajnal conjecture for graphs with bounded VC-dimension, On the hat guessing number of a planar graph class, Bipartite induced density in triangle-free graphs, Bounds for chromatic number in terms of even-girth and booksize, Diagonal Ramsey via effective quasirandomness, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Acyclic edge coloring of graphs with large girths, On Brooks' Theorem for Sparse Graphs, Dynamic concentration of the triangle‐free process, Bounds on Ramsey games via alterations, The Erdős–Gyárfás function with respect to Gallai‐colorings, Cubic graphs with total domatic number at least two, On Ramsey Size-Linear Graphs and Related Questions, Probability bounds for \(n\) random events under \((n-1)\)-wise independence, Ramsey numbers involving large dense graphs and bipartite Turán numbers, A note on pseudorandom Ramsey graphs, The asymptotics of \(r(4,t)\), Clique covers of \(H\)-free graphs, Ramsey numbers of \(K_3\) and \(K_{n,n}\), Generalised Ramsey numbers for two sets of cycles, A remark concerning arithmetic progressions, Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022, Unnamed Item, A note concerning paths and independence number in digraphs, A short proof of Bernoulli disjointness via the local lemma, Equitable two-colorings of uniform hypergraphs, Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs, The order dimension of divisibility, Ramsey numbers of some bipartite graphs versus complete graphs, Turán and Ramsey Properties of Subcube Intersection Graphs, The Lovász local lemma and variable strength covering arrays, A large number of \(m\)-coloured complete infinite subgraphs, Weighted dependency graphs, On small graphs with highly imperfect powers, A Kolmogorov complexity proof of the Lovász local lemma for satisfiability, Ramsey-goodness -- and otherwise, Hypergraph Ramsey numbers, The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma, Some constructive bounds on Ramsey numbers, A lower bound for off-diagonal van der Waerden numbers, A note on Ramsey size-linear graphs, The early evolution of the \(H\)-free process, The Ramsey number for a cycle of length five vs. a complete graph of order six, Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory, Injective edge-coloring of graphs with given maximum degree, Star-factors in graphs with large minimum degree, Coloring \(d\)-embeddable \(k\)-uniform hypergraphs, Ramsey numbers involving graphs with large degrees, An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles, Rainbow factors in hypergraphs, Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem, Distributed algorithms for the Lovász local lemma and graph coloring, Ramsey-type theorems, The triangle-free process, Approximating hyper-rectangles: Learning and pseudorandom sets, Counting Hypergraph Colorings in the Local Lemma Regime, An Improvement of the Lovász Local Lemma via Cluster Expansion, Measurable versions of the Lovász local lemma and measurable graph colorings, ON EMBEDDINGS OF FINITE METRIC SPACES IN, On minimal Ramsey graphs and Ramsey equivalence in multiple colours, Hamiltonicity in random directed graphs is born resilient, On the cover Ramsey number of Berge hypergraphs, On Erdős-Rado numbers, Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma, Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure, How to make a graph bipartite, The Erdős-Hajnal conjecture for three colors and triangles, On a problem of Spencer, A local density condition for triangles
Cites Work
