Complete r-partite subgraphs of dense r-graphs
classification
🧮 math.CO
keywords
graphsr-partitecompletedecreasingdensedetermineedgeserdos
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.