• Corpus ID: 62796852

Combinatorial theorems relative to a random set

@article{Conlon2014CombinatorialTR,
  title={Combinatorial theorems relative to a random set},
  author={David Conlon},
  journal={arXiv: Combinatorics},
  year={2014}
}
  • D. Conlon
  • Published 12 April 2014
  • Mathematics
  • arXiv: Combinatorics
We describe recent advances in the study of random analogues of combinatorial theorems. 
Short proofs of some extremal results III
We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph
Short proofs of some extremal results II
Counting configuration-free sets in groups
Counting independent sets in graphs
C O ] 1 8 O ct 2 01 9 Short proofs of some extremal results III
We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph
Color‐biased Hamilton cycles in random graphs
We prove that a random graph G(n,p) , with p above the Hamiltonicity threshold, is typically such that for any r‐coloring of its edges there exists a Hamilton cycle with at least (2/(r+1)−o(1))n
A short nonalgorithmic proof of the containers theorem for hypergraphs
Recently the breakthrough method of hypergraph containers, developed independently by Balogh, Morris, and Samotij as well as Saxton and Thomason, has been used to study sparse random analogues of a
Dirac's theorem for random graphs
TLDR
Motivated by the study of resilience of random graph properties, it is proved that if p ≫ log n/n, then a.s. every subgraph of G(n,p) with minimum degree at least (1/2 + o (1) )np is Hamiltonian.
Structure and randomness in extremal combinatorics
In this thesis we prove several results in extremal combinatorics from areas including Ramsey theory, random graphs and graph saturation. We give a random graph analogue of the classical Andr´asfai,
Dirac-type theorems in random hypergraphs
...
...

References

SHOWING 1-10 OF 117 REFERENCES
A combinatorial problem in geometry
Our present problem has been suggested by Miss Esther Klein in connection with the following proposition.
Threshold functions
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold function. This generalises a number of classical results in the theory of random graphs.
Blow-up Lemma
Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs.
Ramsey's Theorem - A New Lower Bound
  • J. Spencer
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. A
  • 1975
The Green-Tao theorem: an exposition
The celebrated Green-Tao theorem states that the prime numbers contain arbitrarily long arithmetic progressions. We give an exposition of the proof, incorporating several simplifications that have
Randomness and regularity
TLDR
Recent progress on recent progress on this subject related to some variants of Szemeredi�s Regularity Lemma is reported on.
Regularity Lemmas for Graphs
Szemeredi’s regularity lemma proved to be a fundamental result in modern graph theory. It had a number of important applications and is a widely used tool in extremal combinatorics. For some further
Turán's theorem in sparse random graphs
TLDR
It is shown that with probability 1 - o(1), one needs to delete approximately 1/k-1-fraction of the edges in a random graph in order to destroy all cliques of size k.
Bandwidth theorem for random graphs
A new proof of Szemerédi's theorem
In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of these
...
...