Hitting time for Hamilton cycles in pseudorandom graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Yaobin, Chen, Yu, Im, Seonghyuk, Wang, Yiting |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Note on the trace of random walks on pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)
by: Chen, Yaobin, et al.
Published: (2026)
Berge Hamilton cycles in a random sparsification of dense hypergraphs
by: Im, Seonghyuk, et al.
Published: (2025)
by: Im, Seonghyuk, et al.
Published: (2025)
Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)
by: Chen, Yaobin, et al.
Published: (2025)
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
by: Draganić, Nemanja, et al.
Published: (2025)
by: Draganić, Nemanja, et al.
Published: (2025)
On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)
by: Wang, Yiting
Published: (2026)
The Hamilton space of pseudorandom graphs
by: Christoph, Micha, et al.
Published: (2024)
by: Christoph, Micha, et al.
Published: (2024)
Perturbation of dense graphs
by: Han, Jie, et al.
Published: (2025)
by: Han, Jie, et al.
Published: (2025)
The perturbation threshold of degenerate graphs
by: Han, Jie, et al.
Published: (2026)
by: Han, Jie, et al.
Published: (2026)
Dirac's theorem for linear hypergraphs
by: Im, Seonghyuk, et al.
Published: (2024)
by: Im, Seonghyuk, et al.
Published: (2024)
On high discrepancy $1$-factorizations of complete graphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Note on the codegree version of the Erdős--Ko--Rado theorem
by: Gan, Luyining, et al.
Published: (2026)
by: Gan, Luyining, et al.
Published: (2026)
Sidorenko's conjecture for subdivisions and theta substitutions
by: Im, Seonghyuk, et al.
Published: (2024)
by: Im, Seonghyuk, et al.
Published: (2024)
Turán problems in pseudorandom graphs
by: Liu, Xizhi, et al.
Published: (2022)
by: Liu, Xizhi, et al.
Published: (2022)
An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
Colour-biased Hamilton cycles in randomly perturbed graphs
by: Chen, Wenchong, et al.
Published: (2025)
by: Chen, Wenchong, et al.
Published: (2025)
Spanning clique subdivisions in pseudorandom graphs
by: Lee, Hyunwoo, et al.
Published: (2025)
by: Lee, Hyunwoo, et al.
Published: (2025)
The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)
by: Hefetz, Dan, et al.
Published: (2025)
Colorful Hamilton cycles in random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)
by: Chakraborti, Debsoumya, et al.
Published: (2021)
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
by: Ahn, Jungho, et al.
Published: (2022)
by: Ahn, Jungho, et al.
Published: (2022)
Graph with any rational density and no rich subsets of linear size
by: Im, Seonghyuk, et al.
Published: (2024)
by: Im, Seonghyuk, et al.
Published: (2024)
Ramsey--Dirac theory for bounded degree hypertrees
by: Han, Jie, et al.
Published: (2024)
by: Han, Jie, et al.
Published: (2024)
Disjoint connected dominating sets in pseudorandom graphs
by: Draganić, Nemanja, et al.
Published: (2024)
by: Draganić, Nemanja, et al.
Published: (2024)
Spectral expansion properties of pseudorandom bipartite graphs
by: Fan, Dandan, et al.
Published: (2024)
by: Fan, Dandan, et al.
Published: (2024)
Near rainbow Hamilton cycles in dense graphs
by: Peng, Danni, et al.
Published: (2024)
by: Peng, Danni, et al.
Published: (2024)
Powers of Hamilton cycles in oriented and directed graphs
by: DeBiasio, Louis, et al.
Published: (2024)
by: DeBiasio, Louis, et al.
Published: (2024)
Colour-biased Hamilton cycles in dense graphs and random graphs
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)
by: Granet, Bertille, et al.
Published: (2024)
An exact Ore-degree condition for Hamilton cycles in oriented graphs
by: Chang, Yulin, et al.
Published: (2025)
by: Chang, Yulin, et al.
Published: (2025)
Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)
by: Behague, Natalie, et al.
Published: (2026)
The square of a Hamilton cycle in randomly perturbed graphs
by: Böttcher, Julia, et al.
Published: (2022)
by: Böttcher, Julia, et al.
Published: (2022)
The Hamilton cycle space of random regular graphs and randomly perturbed graphs
by: Hefetz, Dan, et al.
Published: (2025)
by: Hefetz, Dan, et al.
Published: (2025)
Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
by: Cai, Yiting, et al.
Published: (2026)
by: Cai, Yiting, et al.
Published: (2026)
Sharp threshold for Hamilton cycles in randomly perturbed sparse graphs
by: Ma, Guorui, et al.
Published: (2026)
by: Ma, Guorui, et al.
Published: (2026)
A spectral condition for Hamilton cycles in tough bipartite graphs
by: Ai, Lianyang, et al.
Published: (2025)
by: Ai, Lianyang, et al.
Published: (2025)
Hamilton cycles in vertex-transitive graphs of order $6p$
by: Du, Shaofei, et al.
Published: (2024)
by: Du, Shaofei, et al.
Published: (2024)
Hamilton cycles in regular graphs perturbed by a random 2-factor
by: Cicely, et al.
Published: (2025)
by: Cicely, et al.
Published: (2025)
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
by: DeBiasio, Louis, et al.
Published: (2025)
by: DeBiasio, Louis, et al.
Published: (2025)
Embedding loose trees in $k$-uniform hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)
by: Chen, Yaobin, et al.
Published: (2025)
Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
by: Díaz, Alberto Espuny, et al.
Published: (2025)
by: Díaz, Alberto Espuny, et al.
Published: (2025)
Spectrally indistinguishable pseudorandom graphs
by: Forey, Arthur, et al.
Published: (2025)
by: Forey, Arthur, et al.
Published: (2025)
Similar Items
-
Note on the trace of random walks on pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026) -
Berge Hamilton cycles in a random sparsification of dense hypergraphs
by: Im, Seonghyuk, et al.
Published: (2025) -
Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025) -
Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
by: Draganić, Nemanja, et al.
Published: (2025) -
On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)