Results 181 to 190 of about 58,072 (195)

Universal limit theorems in graph coloring problems with connections to extremal combinatorics

Annals of Applied Probability, 2017
Bhaswar Bhattacharya, Sumit Mukherjee
exaly  

Spectral Methods in Extremal Combinatorics.

Extremal combinatorics studies how large a collection of objects can be if it satisfies a given set of restrictions. Inspired by a classical theorem due to Erdos, Ko and Rado, Simonovits and Sos posed the following problem: determine how large a collection of graphs on the vertex set {1,.,n} can be, if the intersection of any two of them contains a ...
openaire   +1 more source

Extremal Combinatorics

Texts in Theoretical Computer Science, 2011
Stasys Jukna
exaly  

Refuting conjectures in extremal combinatorics via linear programming

Journal of Combinatorial Theory - Series A, 2020
Adam Zsolt Wagner
exaly  

Restricted problems in extremal combinatorics

2023
openaire   +1 more source

Treewidth computation and extremal combinatorics

Combinatorica, 2012
Fedor V Fomin, Yngve Villanger
exaly  

- Extremal combinatorics

2015
openaire   +1 more source

Short proofs of some extremal results II

Journal of Combinatorial Theory Series B, 2016
David Conlon, Jacob Fox, Benny Sudakov   +2 more
exaly  

Birational contractions of $$\overline{\mathrm {M}}_{0,n}$$ M ¯ 0 , n and combinatorics of extremal assignments

Journal of Algebraic Combinatorics, 2017
Han-Bom Moon, James von Albade
exaly  

Recent Developments in Extremal Combinatorics: Ramsey and Turán Type Problems

2011
Benny Sudakov
exaly