Academic Journal
The Hamilton space of pseudorandom graphs
| Τίτλος: | The Hamilton space of pseudorandom graphs |
|---|---|
| Συγγραφείς: | Christoph , Micha, Nenadov , Rajko, Petrova , Kalina |
| Πηγή: | Journal of Combinatorial Theory, Series B, 176 |
| Στοιχεία εκδότη: | Elsevier |
| Έτος έκδοσης: | 2026 |
| Συλλογή: | ETH Zürich Research Collection |
| Θεματικοί όροι: | Random graphs, Extremal combinatorics, Hamilton cycles, Pseudorandom graphs, Expanders, Switchers, Spanning structures, Dirac graphs |
| Περιγραφή: | We show that if n is odd and p≥Clogn/n, then with high probability Hamilton cycles in G(n,p) span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties. The proof is based on a novel idea of parity-switchers, which can be thought of as analogues of absorbers in the context of cycle spaces. As another application of our method, we show that Hamilton cycles in a near-Dirac graph G, that is, a graph G with odd n vertices and minimum degree n/2+C for sufficiently large constant C, span its cycle space. ; ISSN:0095-8956 |
| Τύπος εγγράφου: | article in journal/newspaper |
| Περιγραφή αρχείου: | application/application/pdf |
| Γλώσσα: | English |
| Relation: | info:eu-repo/grantAgreement/SNF/Sinergia/173721; https://hdl.handle.net/20.500.11850/786033 |
| DOI: | 10.3929/ethz-c-000786033 |
| Διαθεσιμότητα: | https://hdl.handle.net/20.500.11850/786033 https://doi.org/10.3929/ethz-c-000786033 |
| Rights: | info:eu-repo/semantics/openAccess ; http://creativecommons.org/licenses/by/4.0/ ; Creative Commons Attribution 4.0 International |
| Αριθμός Καταχώρησης: | edsbas.2111F1AC |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.3929/ethz-c-000786033 |
|---|