arXiv (All)
open access
On Colorful Kruskal--Katona Theorems
What is the maximum number of rainbow triangles in an edge-colored graph with $m$ edges and $r$ colors? Using entropic techniques, we prove an upper bound of $C_rm^{3/2}$ rainbow triangles with $C_r=\sqrt{\frac{2(r-2)}{9r}}$; this constant is best possible whenever there exists an affine plane of or
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Erratum to “Proper Edge Colorings of Planar Graphs With Rainbow C 4 ‐s”#818486
- Bull-free graphs and $χ$-boundedness#972374
- A Pre-formal Proof of Why No Planar Map Needs More Than Four Colours#116629
- The Maximum Number of Shortest Paths in Graphs#924228
- The Maximum Number of Shortest Paths in Graphs#919997
Record · ID 1157513
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive