On a maximal anti-Ramsey conjecture of Burr, Erdős, Graham, and Sós — Quantapedia

Given a graph $H$, the maximal anti-Ramsey function $f(n,e,H)$ denotes the minimum integer $f$ for which there exists an $n$-vertex graph $G$ with at least $e$ edges admitting an edge-coloring with $f

Powered by Quantum Pulse Intelligence