The Erdős-Gallai theorem modulo k

MaRDI QIDQ5109072zbMATH OpenFDO

Authors Richard A. Brualdi, Seth A. Meyer

Publication date 7 May 2020

Full work available at URL http://ajc.maths.uq.edu.au/pdf/76/ajc_v76_p339.pdf

zbMATH Keywords

degree sequences of graphsinterval-constrained sequences of graphs

Mathematics Subject Classification ID

Vertex degrees (05C07)

Recommendations

• A simple proof of the Erdos-Gallai theorem on graph sequences
• A note on a theorem of Erdős and Gallai
• Generalization of the Erdős-Gallai inequality.
• The Erdős-Gallai criterion and symmetric functions
• scientific article; zbMATH DE number 1618191

Cites work

• scientific article; zbMATH DE number 7057496 (Why is no real title available?)
• A sharp refinement of a result of Zverovich-Zverovich
• Combinatorial matrix classes
• Combinatorial matrix theory
• Graph factors modulo \(k\)
• Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps

Cited in

(5)

• Cameron-Erdős modulo a prime
• An Erdős-Gallai-type theorem for keyrings
• scientific article; zbMATH DE number 7057496 (Why is no real title available?)
• Lucas’ Theorem Modulo p²
• Reducing the Erdős–Moser Equation 1 n + 2 n + ⋯ + kn = (k + 1) n Modulo k and k 2

This page was built for publication: The Erdős-Gallai theorem modulo \(k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109072)