An Entropy-Based Proof for the Moore Bound for Irregular Graphs

DOI10.1007/978-3-319-05446-9_10zbMath1345.05048arXiv1011.1058OpenAlexW1791758941MaRDI QIDQ2821702

S. Ajesh Babu

Publication date: 22 September 2016

Published in: Perspectives in Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.1058

zbMATH Keywords

graphsgirthMoore bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• The Moore bound for irregular graphs
• The size of bipartite graphs with a given girth
• Entropy, independent sets and antichains: A new approach to Dedekind’s problem
• An upper bound on the number of Steiner triple systems
• Algebraic Graph Theory
• An entropy proof of Bregman's theorem

This page was built for publication: An Entropy-Based Proof for the Moore Bound for Irregular Graphs