Combinatorial theorems relative to a random set

2014/04/12 by David Conlon, Conlon, David · 1 citation
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1404.3324

Abstract

We describe recent advances in the study of random analogues of combinatorial theorems.

Citations

• Some Theorems on Abstract Graphs
• On a Problem of Formal Logic
• On Certain Sets of Integers

Cited by

• On some multicolour Ramsey properties of random graphs

Related

• A View From The Bridge Spanning Combinatorics and Probability
• Random pure sets
• Random Finite Sumsets and Product Sets in Subsets of the Natural Numbers
• Stability results for random discrete structures
• Searching for (sharp) thresholds in random structures: where are we now?