Asymptotic lower bounds for Ramsey functions

Cites work

scientific article; zbMATH DE number 3182201 (Why is no real title available?)
scientific article; zbMATH DE number 3482343 (Why is no real title available?)
Graph Theory and Probability
Graph Theory and Probability. II
Ramsey's theorem - a new lower bound
Some remarks on the theory of graphs

Cited in

(95)

On Brooks' Theorem for Sparse Graphs
A large number of \(m\)-coloured complete infinite subgraphs
An algorithmic proof of the Lovász local lemma via resampling oracles
Probabilistic methods
The Erdős–Gyárfás function with respect to Gallai‐colorings
Counting hypergraph colorings in the local lemma regime
Measurable versions of the Lovász local lemma and measurable graph colorings
A short proof of Bernoulli disjointness via the local lemma
Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
Weighted dependency graphs
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
A note on Ramsey size-linear graphs
The order dimension of divisibility
On minrank and forbidden subgraphs
On embeddings of finite metric spaces in \(l^n_\infty \)
On Ramsey Size-Linear Graphs and Related Questions
On the hat guessing number of a planar graph class
The Lovász local lemma and variable strength covering arrays
Acyclic edge coloring of graphs with large girths
How to make a graph bipartite
Dynamic concentration of the triangle‐free process
A Kolmogorov complexity proof of the Lovász local lemma for satisfiability
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
Packing nearly optimal Ramsey \(R(3,t)\) graphs
Ramsey numbers of \(K_3\) and \(K_{n,n}\)
On Ramsey numbers of uniform hypergraphs with given maximum degree
Cubic graphs with total domatic number at least two
On a problem of Spencer
A lower bound for off-diagonal van der Waerden numbers
Bipartite induced density in triangle-free graphs
On the minimum degree of minimal Ramsey graphs for multiple colours
The triangle-free process
On minimal Ramsey graphs and Ramsey equivalence in multiple colours
On the Ramsey number \(r(H+\overline{K_ n},K_ n)\)
On connectivity in random graph models with limited dependencies
Distributed algorithms for the Lovász local lemma and graph coloring
Tough Ramsey graphs without short cycles
The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
Ramsey numbers involving large dense graphs and bipartite Turán numbers
Injective edge-coloring of graphs with given maximum degree
On the proof complexity of Paris-Harrington and off-diagonal Ramsey tautologies
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
First-fit colorings of graphs with no cycles of a prescribed even length
Spanning cycles in random directed graphs
A Ramsey problem of Harary on graphs with prescribed size
Star-factors in graphs with large minimum degree
Approximating hyper-rectangles: Learning and pseudorandom sets
Equitable two-colorings of uniform hypergraphs
The Ramsey number for a cycle of length five vs. a complete graph of order six
Some constructive bounds on Ramsey numbers
The early evolution of the \(H\)-free process
Rainbow factors in hypergraphs
The asymptotics of \(r(4,t)\)
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
Ramsey-type theorems
Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity
On Erdős-Rado numbers
A remark concerning arithmetic progressions
SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
A general framework for hypergraph coloring
Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem
An improvement of the Lovász local lemma via cluster expansion
Clique covers of \(H\)-free graphs
Hypergraph Ramsey numbers
Chain method for panchromatic colorings of hypergraphs
On the cover Ramsey number of Berge hypergraphs
A note concerning paths and independence number in digraphs
Coloring Steiner Triple Systems
Rainbow Hamilton cycles and lopsidependency
Treewidth versus clique number. I: Graph classes with a forbidden structure
On conflict-free multi-coloring
Ramsey numbers of some bipartite graphs versus complete graphs
Bounds on Ramsey games via alterations
Ramsey numbers involving graphs with large degrees
On small graphs with highly imperfect powers
Turán and Ramsey properties of subcube intersection graphs
A local density condition for triangles
Ramsey Size Linear Graphs
Probability bounds for \(n\) random events under \((n-1)\)-wise independence
Hamiltonicity in random directed graphs is born resilient
Combinatorics. Abstracts from the workshop held January 1--7, 2023
Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022
ASYMPTOTIC BOUNDS FOR IRREDUNDANT RAMSEY NUMBERS
Generalised Ramsey numbers for two sets of cycles
Bounds for chromatic number in terms of even-girth and booksize
Counting solutions to random CNF formulas
An improved bound for the stepping-up lemma
Ramsey-goodness -- and otherwise
The Erdős-Hajnal conjecture for three colors and triangles
Erdős-Hajnal conjecture for graphs with bounded VC-dimension
Diagonal Ramsey via effective quasirandomness
A note on pseudorandom Ramsey graphs
A note on the Erdős-Hajnal hypergraph Ramsey problem

This page was built for publication: Asymptotic lower bounds for Ramsey functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245976)