It Is Better to Be Semi-Regular When You Have a Low Degree

Type: Article

Publication Date: 2024-11-23

Citations: 0

DOI: https://doi.org/10.3390/e26121014

Locations

Similar Works

Action Title Year Authors
+ It is better to be semi-regular when you have a low degree 2021 Théodore Kolokolnikov
+ Attainable bounds for algebraic connectivity and maximally-connected regular graphs 2023 Geoffrey Exoo
Théodore Kolokolnikov
Jeanette Janssen
Timothy Salamon
+ Sparse Quasi-Random Graphs 2002 Fan Chung
Ronald L. Graham
+ The diameter of random regular graphs 1982 Béla Bollobás
W. Fernandez de la Véga
+ The Diameter of Dense Random Regular Graphs 2019 Nobutaka Shimizu
+ The Diameter of Dense Random Regular Graphs 2019 伸高 清水
+ Almost All Regular Graphs are Normal 2015 Seyed Saeed Changiz Rezaei
Seyyed Aliasghar Hosseini
Bojan Mohar
+ Random Regular Graphs 2000 Svante Janson
Tomasz Łuczak
Andrzej Ruciński
+ Regular Networks 2008 Ted G. Lewis
+ Toughness in pseudo-random graphs 2020 Xiaofeng Gu
+ Upper Tails of Subgraph Counts in Sparse Regular Graphs 2021 Benjamin Gunby
+ Spectral Statistics of Random d-Regular Graphs 2019 Jiaoyang Huang
+ Minimum algebraic connectivity and maximum diameter: Aldous--Fill and Guiduli--Mohar conjectures 2022 Maryam Abdi
Ebrahim Ghorbani
+ Almost all regular graphs are normal 2017 Seyed Saeed Changiz Rezaei
Seyyed Aliasghar Hosseini
Bojan Mohar
+ Almost All Regular Graphs are Normal 2015 Seyed Saeed Changiz Rezaei
Seyyed Aliasghar Hosseini
Bojan Mohar
+ Ramsey Goodness of Clique Versus Paths in Random Graphs 2021 Luiz Moreira
+ Upper Tails of Subgraph Counts in Sparse Regular Graphs 2020 Benjamin Gunby
+ 5. Random Graphs 2011 Ricard V. Solé
+ Random Algebraic Graphs and Their Convergence to Erdos-Renyi 2023 Kiril Bangachev
Guy Bresler
+ Triangle Factors In Sparse Pseudo-Random Graphs 2004 Michael Krivelevich
Benni Sudakov†
Tibor Szabó

Works That Cite This (0)

Action Title Year Authors