Dependent random choice
From MaRDI portal
Publication:3068761
DOI10.1002/rsa.20344zbMath1215.05159arXiv0909.3271OpenAlexW2037951482MaRDI QIDQ3068761
Publication date: 17 January 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0909.3271
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10)
Related Items (50)
On explicit constructions of designs ⋮ A Folkman Linear Family ⋮ Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ Packing Hamilton Cycles Online ⋮ Large unavoidable subtournaments ⋮ Turán theorems for unavoidable patterns ⋮ Short proofs of some extremal results. II. ⋮ On the Extremal Number of Subdivisions ⋮ On the Ramsey-Turán number with small \(s\)-independence number ⋮ A generalization of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem ⋮ Few products, many h-fold sums ⋮ The Turán number of blow-ups of trees ⋮ Two extensions of Ramsey's theorem ⋮ An approximate version of Sidorenko's conjecture ⋮ A minimum degree condition forcing complete graph immersion ⋮ Sidorenko's conjecture for blow-ups ⋮ Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Sets without k‐term progressions can have many shorter progressions ⋮ The intersection spectrum of 3‐chromatic intersecting hypergraphs ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ Clique-factors in graphs with sublinear -independence number ⋮ On Ramsey Size-Linear Graphs and Related Questions ⋮ Rainbow clique subdivisions ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Large Unavoidable Subtournaments ⋮ Finding unavoidable colorful patterns in multicolored graphs ⋮ On the Ramsey-Turán numbers of graphs and hypergraphs ⋮ Partial associativity and rough approximate groups ⋮ Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz ⋮ A counterexample to sparse removal ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ More on the extremal number of subdivisions ⋮ Two results on Ramsey-Turán theory ⋮ Induced Turán Numbers ⋮ Ramsey numbers of cubes versus cliques ⋮ The critical window for the classical Ramsey-Turán problem ⋮ On the rational Turán exponents conjecture ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ On the relation of separability, bandwidth and embedding ⋮ Short proofs of some extremal results III ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ The Ramsey number of the clique and the hypercube ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ Cycles Are Strongly Ramsey-Unsaturated ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Subdivisions of a large clique in \(C_6\)-free graphs ⋮ Tight bounds for powers of Hamilton cycles in tournaments ⋮ Phase transitions in Ramsey-Turán theory
Cites Work
- Unnamed Item
- Unnamed Item
- On graphs with small Ramsey numbers. II.
- An approximate version of Sidorenko's conjecture
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
- Product representations of polynomials
- On Ramsey numbers of uniform hypergraphs with given maximum degree
- Unavoidable subgraphs of colored graphs
- On a problem of Duke-Erdős-Rödl on cycle-connected subgraphs
- Unavoidable patterns
- Density theorems for bipartite graphs and related Ramsey-type results
- Ramsey goodness and beyond
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
- On the Ramsey number of sparse 3-graphs
- Minors in expanding graphs
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Edge-coloring cliques with three colors on all 4-cliques
- Norm-graphs: Variations and applications
- A statistical theorem of set addition
- Constructive bounds for a Ramsey-type problem
- On Conway's thrackle conjecture
- A few remarks on Ramsey--Turán-type problems
- On book-complete graph Ramsey numbers
- Graphs with linearly bounded Ramsey numbers
- A correlation inequality for bipartite graphs
- The Littlewood-Gowers problem
- 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
- On graphs with small Ramsey numbers*
- Cube Ramsey numbers are polynomial
- Property testing and its connection to learning and approximation
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- On the Littlewood Problem Modulo a Prime
- Induced subgraphs of prescribed size
- On large intersecting subfamilies of uniform setfamilies
- On graphs with linear Ramsey numbers
- On Ramsey Numbers of Sparse Graphs
- Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems
- Bounding Ramsey numbers through large deviation inequalities
- Ramsey-Type Problem for an Almost Monochromatic $K_4$
- The Construction of Certain Graphs
- Ramsey numbers of sparse hypergraphs
- Testing subgraphs in directed graphs
- Crossing patterns of segments
- On bipartite graphs with linear Ramsey numbers
This page was built for publication: Dependent random choice
