Four-cycle supersaturation and polarity stability at $q^2+q$ vertices
Source: hexagonmath.org/abs/2611.00176v1
Let $m_0=\frac12q(q+1)^2-q$. For every even $q\ge1600$, we prove that a graph on $q^2+q$ vertices with at least $m_0+1$ edges contains at least $\lceil(q-1)/12\rceil$ four-cycles. For powers of two in this range, $m_0$ is the extremal number and a polarity construction has exactly $q-1$ four-cycles at $m_0+1$ edges. These bounds determine the order of magnitude of the minimum count on this sequence. We also prove a stability theorem: for every nonnegative integer $b$ and every even $q\ge10^{18}(b+1)^{16}$, each $C_4$-free graph on $q^2+q$ vertices with $m_0-b$ edges is a spanning subgraph of…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00176
curl -X POST /api/v1/records/hexagon/2611.00176/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00176/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'