| First Authors | Michael Borinski |
|---|---|
| Authors | Michael Borinski, Chiara Meroni, Maximilian Wiesmann |
| Corresponding Authors | |
| Last Authors | Maximilian Wiesmann |
| Journal Name | ArXiv (ArXiv) |
| Volume | |
| Issue | |
| Article Number | arXiv:2601.18994 |
| Open Access | true |
| Print Publication Date | |
| Online Publication Date | 2026-01-26 |
| Abstract | We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an application, we compute the expected number of proper -edge-colorings of a large random -regular graph. |
| Cover Image | |
| Affiliated With | Maraj, Postdocs, CSBD |
| Selected By | |
| Acknowledged Services | |
| Publication Status | Published |
| Edoc Link | |
| Sfx Link | |
| DOI | |
| PubMed ID | |
| WebOfScience Link | |
| Alternative Full Text URL | https://doi.org/10.48550/arXiv.2601.18994 |
| Display Publisher Download Only | false |
| Visible On MPI-CBG Website | true |
| PDF Downloadable | true |
| Created By | thuem |
| Added Date | 2026-02-12 |
| Last Edited By | thuem |
| Last Edited Date | 2026-02-12 15:07:22.635 |
| Library ID | 9140 |
| Document ID | |
| Entry Complete | true |
| eDoc Compliant | false |
| Include in Edoc Report | false |
| In Pure | false |
| Ready for eDoc Export | false |
| Author Affiliations Complete | false |
| Project Name | |
| Project URL | |
| Grant ID | |
| Funding Programme | |
| Funding Organisation |