Asymptotic behavior for joint Turán number for \(3\)- and \(4\)-cycles
Home
Search
Subjects
About Erdös
About This Site
Search
Subjects
- All (170)
- Ramsey Theory (40)
- Extremal Graph Theory (40)
- Coloring, Packing, and Covering (25)
- Random Graphs and Graph Enumeration (16)
- Hypergraphs (35)
- Infinite Graphs (14)
About Erdös
About This Site
For a finite family \( {\mathcal F}\) of graphs, let \( t(n, {\mathcal{F}})\) denote the smallest integer \( m\) that every graph on \( n\) vertices and \( m\) edges must contain a member of \( \mathcal{F}\) as a subgraph. Erdös and Simonovits [1] raised the following question:
A problem on the Turán number of \(C_3\) and \(C_4\)[1]
Is it true that \[ t(n,\{C_3,C_4\}) = \frac 1 {2 \sqrt 2} n^{3/2} + O(n)~ ?\]
Bibliography | |
---|---|
1 |
P. Erdös and M. Simonovits, Compactness results in extremal graph
theory, Combinatorica 2 (1982), 275-288.
|