Some extremal problems in graph theory

48 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The History of Degenerate (Bipartite) Extremal Graph Problems (2013, methodology): “ one side of L. 7.1. The Erdo˝s-Simonovits Reduction and the Cube theorem We have already mentioned Theorem 1.5, on the extremal number of the cube. Here we formulate a sharpening of it. Theorem 7.1 ([90]). Let Q 8 denote the graph determined by the 8 vertices and 12 edges of a cube, and Q+ 8 denote”
The early evolution of the H-free process (2009, background): “H) when H= Kr is complete: the unique largest graph on nvertices with no Kr subgraph is complete (r− 1)-partite with part sizes as equal as possible. For general H, the Erd˝os-StoneSimonovits theorem [16, 14] gives the estimate ex(n,H) = ex(n,Kr)+o(n2), where r= χ(H) is the chromatic number of H. Th”
Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles (2020, methodology): “We will use the following lemma of Jiang and Seiver, which is a slight modification of a much earlier result by Erdős and Simonovits [9].”