Complete r-partite subgraphs of dense r-graphs

2007/11/07 by Vladimir Nikiforov, Nikiforov, Vladimir · 1 citation
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.0711.1185

Abstract

We determine how large r-partite graphs can be found in r-uniform graphs with n vertices and Cn^r edges, where C is a slowly decreasing function of n. This refines results of Erdos from 1964.

Citations

• On extremal problems of graphs and generalized graphs

Cited by

• Hypergraph Ramsey numbers

Related

• Finding Partite Hypergraphs Efficiently
• Dense H-free graphs are almost (χ(H)-1)-partite
• Decomposing the Complete r-Graph
• Regular subgraphs at every density
• Resolution of the Erdős-Sauer problem on regular subgraphs