REVIEW
Bounding the number of cycles in a graph in terms of its degree sequence
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
classification
math.CO
keywords
cyclesgraphnumberbounddegreesequencetermsupper
read the original abstract
We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Kir\'aly and Arman and Tsaturian and to improve upper bounds on the maximum number of cycles in a planar graph.
Discussion (0). Continue with ORCID to comment.