Short proofs of some extremal results II

@article{Conlon2016ShortPO,
  title={Short proofs of some extremal results II},
  author={David Conlon and Jacob Fox and Benny Sudakov},
  journal={J. Comb. Theory, Ser. B},
  year={2016},
  volume={121},
  pages={173-196}
}

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

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

Recent developments in graph Ramsey theory

TLDR
There has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics.

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree

TLDR
Here the asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartites graphs are provided.

A remark on the Ramsey number of the hypercube

TLDR
This paper shows that r ( Q n ) = O (2 2 n − cn ) for a universal constant c > 0.

Maximum H-free subgraphs

Given a family of hypergraphs H, let f(m,H) denote the largest size of an H-free subgraph that one is guaranteed to find in every hypergraph with m edges. This function was first introduced by Erdős

Tiling with monochromatic bipartite graphs of bounded maximum degree

We prove that for any r ∈ N, there exists a constant Cr such that the following is true. Let F = {F1, F2, . . . } be an infinite sequence of bipartite graphs such that |V (Fi)| = i and ∆(Fi) ≤ ∆ hold

Ramsey numbers of degenerate graphs

A graph is $d$-degenerate if all its subgraphs have a vertex of degree at most $d$. We prove that there exists a constant $c$ such that for all natural numbers $d$ and $r$, every $d$-degenerate graph

Ramsey numbers of sparse digraphs

Burr and Erdős in 1975 conjectured, and Chvátal, Rödl, Szemerédi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we

References

SHOWING 1-10 OF 151 REFERENCES

Short Proofs of Some Extremal Results

TLDR
These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because each case the relevant proofs are quite short.

Ramsey-type theorems

Regular Partitions of Graphs

Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph

A New Lower Bound For A Ramsey-Type Problem

TLDR
A new lower bound on the size of the maximum subset of G without a copy of complete graph Kr is provided to substantially improve previous bounds of Krivelevich and Bollobás and Hind.

Note on a Generalization of Roth’s Theorem

We give a simple proof that for sufficiently large N, every subset of of size[N 2]of size at least δN 2 contains three points of the form (a,b), (a + d, b), (a, b + d).

Problems and results in Extremal Combinatorics – III

Extremal Combinatorics is one of the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science,

Problems and results in extremal combinatorics - II

  • N. Alon
  • Mathematics
    Discret. Math.
  • 2008

A Note on Ramsey Numbers

A Disproof of a Conjecture of Erdős in Ramsey Theory

Contre-exemples a la conjecture de Erdos et discussion des proprietes des graphes extremaux

Ks-Free Graphs Without Large Kr-Free Subgraphs

TLDR
It is shown that for every 2 ≤ r s , and n sufficiently large, there exist graphs of order n, not containing a complete graph on s vertices, in which every relatively not too small subset of vertices spans a completegraph on r vertices.
...