Short Proofs of Some Extremal Results-Reference-Cited by-同舟云学术

Short Proofs of Some Extremal Results

Published:2013-11-04 Issue:1 Volume:23 Page:8-28
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

CONLON DAVID,FOX JACOB,SUDAKOV BENNY

Abstract

We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference53 articles.

1. Two variants of the size Ramsey number

2. Density theorems for bipartite graphs and related Ramsey-type results.;Fox;Combinatorica,2009

3. An improved bound on the largest induced forests for triangle-free planar graphs.;Kowalik;Discrete Math. Theor. Comput. Sci.,2010

4. Contentment in graph theory: Covering graphs with cliques

5. On a Problem of Formal Logic

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Induced forests in some distance-regular graphs;Discrete Applied Mathematics;2023-12

2. Prague Dimension of Random Graphs;Combinatorica;2023-09-06

3. An overview of graph covering and partitioning;Discrete Mathematics;2022-08

4. Spectral radius and clique partitions of graphs;Linear Algebra and its Applications;2021-12

5. The Namer–Claimer game;Discrete Mathematics;2021-03