A counterexample to the Erdős triangle–four-cycle asymptotic
Version 1 / Nov 20, 2026 / CC BY 4.0
Abstract
We construct an infinite family of finite simple graphs containing neither a triangle nor a four-cycle. Their edge counts exceed the conjectured leading asymptotic in Erdős Problem 573 by a fixed positive factor. For every positive integer , put . The graph has and . Its limiting ratio to is . The construction joins 47 affine three-part pieces along a common root part. A multiplicative partition of reciprocal field labels excludes four-cycles across the pieces, and an additive restriction retains enough internal edges while excluding triangles.
Provenance statement
References
No bibliography entries.
Version history
- v1 · 5 pagesSubmitted by Liam KruerTeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000463. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos-573/tree/75b87c642d5800f5ce45564236ecf065820c9eb1CurrentNov 20, 2026