Short proofs of some extremal results. III
From MaRDI portal
Publication:3386524
Abstract: 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 theory and Ramsey theory, have been collected together because in each case the relevant proofs are reasonably short.
Recommendations
Cites work
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
- scientific article; zbMATH DE number 4110731 (Why is no real title available?)
- scientific article; zbMATH DE number 3659602 (Why is no real title available?)
- scientific article; zbMATH DE number 3784967 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- A conjecture of Erdős on graph Ramsey numbers
- A note on Ramsey numbers
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- An infinite Sidon sequence
- Books in graphs
- Books versus triangles
- Books versus triangles at the extremal density
- Coloring graphs with sparse neighborhoods
- Combinatorial theorems relative to a random set
- Complete minors and independence number
- Connected matchings and Hadwiger's conjecture
- Density theorems for bipartite graphs and related Ramsey-type results
- Dependent random choice
- Extremal problems concerning transformations of the edges of the complete hypergraphs
- Hedgehogs are not colour blind
- Hypergraph packing and sparse bipartite Ramsey numbers
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Induced Ramsey numbers
- Induced Ramsey-type theorems
- Joints in graphs
- Large joints in graphs
- Multiplicative number theory. I. Classical theory
- Norm-graphs and bipartite Turán numbers
- On Hadwiger's Number and the Stability Number
- On Sets of Acquaintances and Strangers at any Party
- On a Ramsey type theorem
- On a theorem of Rademacher-Turán
- On graphs with linear Ramsey numbers
- On sets of integers containing k elements in arithmetic progression
- On the Ramsey multiplicities of graphs—problems and recent results
- On the Ramsey multiplicity of complete graphs
- On the method of typical bounded differences
- On the multicolor Ramsey number of a graph with m edges
- On the number of complete subgraphs and circuits contained in graphs
- Problems and results in extremal combinatorics. I.
- Problems and results in extremal combinatorics. II
- Problems and results in extremal combinatorics. III.
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Random graphs.
- Recent developments in graph Ramsey theory
- Short proofs of some extremal results
- Short proofs of some extremal results. II.
- Sub-Ramsey numbers of arithmetic progressions
- The Ramsey number R(3, t) has order of magnitude t2/log t
- The Ramsey number of dense graphs
- The concentration of the chromatic number of random graphs
- There exist graphs with super‐exponential Ramsey multiplicity constant
- Turánnical hypergraphs
- Two remarks on the Burr-Erdős conjecture
Cited in
(8)- Problems and results in extremal combinatorics. III.
- Infinite Sperner's theorem
- Short proofs of some extremal results. II.
- Ramsey numbers with prescribed rate of growth
- Short proofs of some extremal results
- Graphs with arbitrary Ramsey number and connectivity
- Ramsey non-goodness involving books
- Ramsey numbers upon vertex deletion
This page was built for publication: Short proofs of some extremal results. III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386524)
