Ramsey--Dirac theory for bounded degree hypertrees
Fuente:
arXiv
Saved in:
| Main Authors: | Han, Jie, Im, Seonghyuk, Kim, Jaehoon, Yang, Donglei |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)
by: Chen, Yaobin, et al.
Published: (2025)
Dirac's theorem for linear hypergraphs
by: Im, Seonghyuk, et al.
Published: (2024)
by: Im, Seonghyuk, et al.
Published: (2024)
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)
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)
Ramsey lower bounds for bounded degree hypergraphs
by: Fan, Chunchao, et al.
Published: (2026)
by: Fan, Chunchao, et al.
Published: (2026)
Lower bounds for Ramsey numbers of bounded degree hypergraphs
by: Bradač, Domagoj, et al.
Published: (2025)
by: Bradač, Domagoj, 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)
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)
Ramsey theory of low-degree semialgebraic relations
by: Adibelli, Azem, et al.
Published: (2026)
by: Adibelli, Azem, et al.
Published: (2026)
Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
by: Attwa, Yamaan, et al.
Published: (2025)
by: Attwa, Yamaan, et al.
Published: (2025)
Ramsey numbers of bounded degree trees versus general graphs
by: Montgomery, Richard, et al.
Published: (2023)
by: Montgomery, Richard, et al.
Published: (2023)
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)
On high discrepancy $1$-factorizations of complete graphs
by: Ai, Jiangdong, et al.
Published: (2025)
by: Ai, Jiangdong, et al.
Published: (2025)
Hitting time for Hamilton cycles in pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)
by: Chen, Yaobin, et al.
Published: (2026)
The distance spectral radius of $k$-uniform hypertrees with given number of vertices of maximum degree
by: Liu, Xiaoqi, et al.
Published: (2024)
by: Liu, Xiaoqi, et al.
Published: (2024)
A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs
by: Katz, Jasmin, et al.
Published: (2025)
by: Katz, Jasmin, et al.
Published: (2025)
On a Ramsey--Turán variant of Roth's theorem
by: Bucić, Matija, et al.
Published: (2025)
by: Bucić, Matija, et al.
Published: (2025)
Extremal density for subdivisions with length or sparsity constraints
by: Kim, Jaehoon, et al.
Published: (2024)
by: Kim, Jaehoon, et al.
Published: (2024)
Clique-factors in graphs with low $K_{\ell}$-independence number
by: Chen, Ming, et al.
Published: (2025)
by: Chen, Ming, et al.
Published: (2025)
An exponential improvement for Ramsey lower bounds
by: Ma, Jie, et al.
Published: (2025)
by: Ma, Jie, et al.
Published: (2025)
Transversal packings in families of percolated hypergraphs
by: Han, Jie, et al.
Published: (2025)
by: Han, Jie, et al.
Published: (2025)
Degree conditions for spanning expansion hypertrees
by: Rao, Mengjiao, et al.
Published: (2025)
by: Rao, Mengjiao, et al.
Published: (2025)
Coboundary expansion for the union of determinantal hypertrees
by: Mészáros, András
Published: (2023)
by: Mészáros, András
Published: (2023)
Enumerating planar stuffed maps as hypertrees of mobiles
by: Pagliaroli, Nathan
Published: (2025)
by: Pagliaroli, Nathan
Published: (2025)
Optimal bounds on the polynomial Schur's theorem
by: Kim, Jaehoon, et al.
Published: (2024)
by: Kim, Jaehoon, et al.
Published: (2024)
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)
Modulus of hypertrees
by: Truong, Huy, et al.
Published: (2025)
by: Truong, Huy, et al.
Published: (2025)
The $2$-torsion of determinantal hypertrees is not Cohen-Lenstra
by: Mészáros, András
Published: (2024)
by: Mészáros, András
Published: (2024)
The local weak limit of $k$-dimensional hypertrees
by: Mészáros, András
Published: (2021)
by: Mészáros, András
Published: (2021)
The homology torsion growth of determinantal hypertrees
by: Mészáros, András
Published: (2025)
by: Mészáros, András
Published: (2025)
A note on degree conditions for Ramsey goodness of trees
by: Luo, Zhidan, et al.
Published: (2025)
by: Luo, Zhidan, et al.
Published: (2025)
Upper bounds for multicolour Ramsey numbers
by: Balister, Paul, et al.
Published: (2024)
by: Balister, Paul, et al.
Published: (2024)
An update on multicolor Ramsey lower bounds
by: Campos, Marcelo, et al.
Published: (2026)
by: Campos, Marcelo, et al.
Published: (2026)
Embedding clique subdivisions via crux
by: Yang, Donglei, et al.
Published: (2024)
by: Yang, Donglei, et al.
Published: (2024)
Ramsey theory and strength of graphs
by: Ichishima, Rikio, et al.
Published: (2024)
by: Ichishima, Rikio, et al.
Published: (2024)
Independent set sequence of some linear hypertrees
by: Galvin, David, et al.
Published: (2024)
by: Galvin, David, et al.
Published: (2024)
The ordering of hypertrees and unicyclic hypergraphs by the traces of $\mathcal{A}_α$-tensor
by: Liu, Jueru, et al.
Published: (2025)
by: Liu, Jueru, et al.
Published: (2025)
Recursive upper bounds for the vertex online Ramsey game with applications to hypergraph Ramsey numbers
by: Dobák, Dániel, et al.
Published: (2026)
by: Dobák, Dániel, et al.
Published: (2026)
Similar Items
-
Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025) -
Dirac's theorem for linear hypergraphs
by: Im, Seonghyuk, et al.
Published: (2024) -
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) -
Perturbation of dense graphs
by: Han, Jie, et al.
Published: (2025)