3 papers
math.CO2026
Even-degeneracy of a random graph
Ting-Wei Chao, Dingding Dong, Zixuan Xu
A graph is even-degenerate if one can iteratively remove a vertex of even degree at each step until at most one edge remains. Recently, Janzer and Yip showed that the ErdÅs--Renyi…
math.CO2026
Range of random -homomorphisms on weak expanders
Dingding Dong, Jinyoung Park
We prove that random -homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff…
math.SP2024
Arbitrary Spectral Edge of Regular Graphs
Dingding Dong, Theo McKenzie
We prove that for each and , the set of limit points of the first eigenvalues of sequences of -regular graphs is \[ \{(μ_1,\dots,μ_k): d=μ_1\geq \dots\…