Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)]_K-1N for each K-1 a prime power

DOI10.1145/3313276.3316399MaRDI QIDQ5212858zbMATH OpenOpenAlexFDO

Authors Michael Capalbo

Publication date 30 January 2020

Published in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3313276.3316399

zbMATH Keywords

explicit constructionsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power
• An Explicit Construction of Lower-Diameter Cubic Graphs
• Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter
• scientific article; zbMATH DE number 4014755
• Some large graphs with given degree and diameter

Cited in

(2)

• An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power
• Number Theoretic Designs for Directed Regular Graphs of Small Diameter

This page was built for publication: Explicit \(N\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)]\log_{K-1}N\) for each \(K-1\) a prime power

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