Perturbation of dense graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Han, Jie, Im, Seonghyuk, Wang, Bin, Zhang, Junxue |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The perturbation threshold of degenerate graphs
by: Han, Jie, et al.
Published: (2026)
by: Han, Jie, 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)
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)
Hitting time for Hamilton cycles in pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)
by: Chen, Yaobin, et al.
Published: (2026)
Dirac's theorem for linear hypergraphs
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)
On high discrepancy $1$-factorizations of complete graphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Sidorenko's conjecture for subdivisions and theta substitutions
by: Im, Seonghyuk, et al.
Published: (2024)
by: Im, Seonghyuk, et al.
Published: (2024)
The minimum spectral radius of $tP_4$-saturated graphs
by: Zhang, Junxue, et al.
Published: (2026)
by: Zhang, Junxue, et al.
Published: (2026)
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)
Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)
by: Chen, Yaobin, et al.
Published: (2025)
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)
Some conjectures on $r$-graphs and equivalences
by: Ma, Yulai, et al.
Published: (2024)
by: Ma, Yulai, et al.
Published: (2024)
Tiling $H$ in dense graphs
by: Chen, Nannan, et al.
Published: (2025)
by: Chen, Nannan, et al.
Published: (2025)
Counting subgraphs in locally dense graphs
by: Bradač, Domagoj, et al.
Published: (2024)
by: Bradač, Domagoj, et al.
Published: (2024)
Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)
by: Hollom, Lawrence, 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)
Ramsey-type problems for tilings in dense graphs
by: Balogh, József, et al.
Published: (2025)
by: Balogh, József, et al.
Published: (2025)
Weakly pancyclic vertices in dense nonbipartite graphs
by: Tang, Yurui, et al.
Published: (2026)
by: Tang, Yurui, et al.
Published: (2026)
Near rainbow Hamilton cycles in dense graphs
by: Peng, Danni, et al.
Published: (2024)
by: Peng, Danni, et al.
Published: (2024)
Turán number of complete multipartite graphs in multipartite graphs
by: Han, Jie, et al.
Published: (2024)
by: Han, Jie, et al.
Published: (2024)
Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)
by: Nenadov, Rajko
Published: (2024)
Fractional clique decompositions of dense balanced multipartite graphs
by: Feng, Tao, et al.
Published: (2026)
by: Feng, Tao, et al.
Published: (2026)
The typical structure of dense claw-free graphs
by: Perkins, Will, et al.
Published: (2025)
by: Perkins, Will, et al.
Published: (2025)
The chromatic number of very dense random graphs
by: Yan, Zhifei
Published: (2024)
by: Yan, Zhifei
Published: (2024)
Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)
by: Hladký, Jan, et al.
Published: (2023)
An Alon-Boppana--type bound for very dense graphs, with applications to max-cut
by: Zhang, Shengtong
Published: (2025)
by: Zhang, Shengtong
Published: (2025)
Unavoidable patterns and plane paths in dense topological graphs
by: Keszegh, Balázs, et al.
Published: (2025)
by: Keszegh, Balázs, et al.
Published: (2025)
The spectrum of dense kernel-based random graphs
by: Cipriani, Alessandra, et al.
Published: (2025)
by: Cipriani, Alessandra, et al.
Published: (2025)
Using dense graph limit theory to count cocycles of random simplicial complexes
by: Mészáros, András
Published: (2025)
by: Mészáros, András
Published: (2025)
Monochromatic triangle-tilings in dense graphs without large independent sets
by: Hou, Xinmin, et al.
Published: (2026)
by: Hou, Xinmin, et al.
Published: (2026)
Efficient polynomial-time approximation scheme for the genus of dense graphs
by: Jing, Yifan, et al.
Published: (2020)
by: Jing, Yifan, et al.
Published: (2020)
Crossing numbers of dense graphs on surfaces
by: Hubard, Alfredo, et al.
Published: (2025)
by: Hubard, Alfredo, et al.
Published: (2025)
Clique-factors in graphs with low $K_{\ell}$-independence number
by: Chen, Ming, et al.
Published: (2025)
by: Chen, Ming, et al.
Published: (2025)
On the maximum number of common neighbours in dense random regular graphs
by: Isaev, Mikhail, et al.
Published: (2023)
by: Isaev, Mikhail, et al.
Published: (2023)
On distance transitive graphs and $4$-geodesic transitive graphs
by: Huang, Jun-Jie
Published: (2025)
by: Huang, Jun-Jie
Published: (2025)
A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
by: Gan, Luyining, et al.
Published: (2023)
by: Gan, Luyining, et al.
Published: (2023)
Extremal problems in uniformly dense hypergraphs and digraphs
by: Lin, Hao, et al.
Published: (2026)
by: Lin, Hao, et al.
Published: (2026)
A generalization of the Hamiltonian cycle in dense digraphs
by: Zhang, Jie, et al.
Published: (2024)
by: Zhang, Jie, et al.
Published: (2024)
Similar Items
-
The perturbation threshold of degenerate graphs
by: Han, Jie, et al.
Published: (2026) -
Berge Hamilton cycles in a random sparsification of dense hypergraphs
by: Im, Seonghyuk, et al.
Published: (2025) -
Note on the codegree version of the Erdős--Ko--Rado theorem
by: Gan, Luyining, et al.
Published: (2026) -
Hitting time for Hamilton cycles in pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026) -
Dirac's theorem for linear hypergraphs
by: Im, Seonghyuk, et al.
Published: (2024)