REVIEW 2 cited by
On graphs without cycles of length 0 modulo 4
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Bollob\'as proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of the maximum number of edges in such a graph is known for very few pairs $\ell$ and $k$. In this work we precisely determine the maximum number of edges in a graph containing no cycle of length $0 \bmod 4$.
Forward citations
Cited by 2 Pith papers
-
On $2$-connected graphs avoiding cycles of length $0$ modulo $4$
Every 2-connected n-vertex graph with more than floor((3n-1)/2) edges contains a cycle whose length is a multiple of 4, and this bound is sharp for all n at least 12.
-
A note on two cycles of consecutive even lengths in graphs
If an n-vertex graph has at least 10q + binom(r+1,2) edges, where n-1 = 4q+r, then it contains two cycles of consecutive even lengths unless it is a chain of K5 blocks and one K_{r+1} block.
Discussion (0). Continue with ORCID to comment.