On Milgram's construction and the Duke embedding conjectures
Timothy Sun

TL;DR
This paper extends Milgram's construction to produce higher-genus counterexamples to Duke's conjecture, providing sharper bounds and also addressing related conjectures, with simplified proofs and genus-specific results.
Contribution
It applies Milgram's method to find higher-genus counterexamples to Duke's conjecture and related conjectures, improving bounds and simplifying proofs.
Findings
Counterexamples of higher genus violating Duke's conjecture
Duke's conjecture holds for genus at most 3
Simplified proof of Milgram's construction method
Abstract
Milgram constructed a 28-vertex cubic graph of genus 4 that disproved Duke's conjecture relating Betti number to minimum genus. We apply Milgram's method to construct to find graphs of higher genus violating Duke's conjecture, which gives a sharper bound on that relationship. These graphs are also counterexamples to a related conjecture of Nordhaus et al. on the relationship between minimum and maximum genera of graphs. As a side note, we give a simpler proof of correctness for Milgram's method and we show that Duke's conjecture is true for genus at most 3.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Combinatorial Mathematics
