Small dense subgraphs of a graph
Tao Jiang, Andrew Newman

TL;DR
This paper investigates the maximum edges in large graphs avoiding certain dense small subgraphs, confirming a conjecture for integer degrees and extending known results on the Turán number of the cube graph.
Contribution
It proves the existence of a function controlling Turán numbers for graphs with bounded order and high average degree when the degree is an integer, and extends the cube theorem.
Findings
Confirmed Verstra"ete's conjecture for integer degrees
Established bounds on Turán numbers for specific graph families
Extended the Turán number results for the cube graph Q_3
Abstract
Given a family of graphs, and a positive integer , the Tur\'an number of is the maximum number of edges in an -vertex graph that does not contain any member of as a subgraph. The order of a graph is the number of vertices in it. In this paper, we study the Tur\'an number of the family of graphs with bounded order and high average degree. For every real and positive integer , let denote the family of graphs on at most vertices that have average degree at least . It follows from the Erd\H{o}s-R\'enyi bound that , for some positive constant . Verstra\"ete asked if it is true that for each fixed there exists a function that tends to as such that $ex(n,{\cal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
