:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cheng, Xinbu, Huang, Xinqi, Liu, Hong, Wang, Bin, Yan, Zhifei
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2602.23801
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Colour-biased Hamilton cycles in randomly perturbed graphs
by: Chen, Wenchong, et al.
Published: (2025)

Triangle packings in randomly perturbed graphs
by: Cheng, Xinbu, et al.
Published: (2026)

Sublinear hitting sets for some geometric graphs
by: Cheng, Xinbu, et al.
Published: (2024)

Bollobás-Erdős-Tuza conjecture for graphs with no induced $K_{s,t}$
by: Cheng, Xinbu, et al.
Published: (2024)

Exact values and improved bounds on $k$-neighborly families of boxes
by: Cheng, Xinbu, et al.
Published: (2023)

Degree conditions for spanning expansion hypertrees
by: Rao, Mengjiao, et al.
Published: (2025)

Dirac-type condition for Hamilton-generated graphs
by: Hou, Xinmin, et al.
Published: (2025)

Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)

Interpolating chromatic and homomorphism thresholds
by: Huang, Xinqi, et al.
Published: (2025)

Spectral Turán-type problems on sparse spanning graphs
by: Liu, Lele, et al.
Published: (2023)

Fan's condition for completely independent spanning trees
by: Ma, Jie, et al.
Published: (2025)

The chromatic number of very dense random graphs
by: Yan, Zhifei
Published: (2024)

Optimal spread for spanning subgraphs of Dirac hypergraphs
by: Kelly, Tom, et al.
Published: (2023)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

Sharp threshold for Hamilton cycles in randomly perturbed sparse graphs
by: Ma, Guorui, et al.
Published: (2026)

Near rainbow Hamilton cycles in dense graphs
by: Peng, Danni, et al.
Published: (2024)

Rainbow spanning structures in strongly edge-colored graphs
by: Ding, Laihao, et al.
Published: (2026)

Colouring Complete Multipartite and Kneser-type Digraphs
by: Harutyunyan, Ararat, et al.
Published: (2023)

A Dirac-type theorem for arbitrary Hamiltonian $H$-linked digraphs
by: Cheng, Yangyang, et al.
Published: (2024)

Quantitative Frameproof Codes and Hypergraphs
by: Zhong, Wenjie, et al.
Published: (2025)

Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
by: Cai, Jin, et al.
Published: (2025)

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

Minimum degree and sparse connected spanning subgraphs
by: Huang, Ting, et al.
Published: (2025)

Peaceful Colourings
by: Liu, Chun-Hung, et al.
Published: (2024)

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

Positive co-degree thresholds for spanning structures
by: Halfpap, Anastasia, et al.
Published: (2024)

A neighborhood union condition for the existence of a spanning tree without samll degree vertices
by: Li, Yibo, et al.
Published: (2025)

On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)

A short note on spanning even trees
by: Ai, Jiangdong, et al.
Published: (2024)

An Ore-type condition for hamiltonicity in graphs
by: Li, Chengli, et al.
Published: (2025)

The Jacobian of a regular orthogonal matroid and torsor structures on spanning quasi-trees of ribbon graphs
by: Baker, Matthew, et al.
Published: (2025)

Dirac-type Theorems for Inhomogenous Random Graphs
by: Ganesan, Ghurumuruhan
Published: (2024)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)

Maximum spanning trees in normed planes
by: Alonso, Javier, et al.
Published: (2026)

The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, et al.
Published: (2026)

Counting spanning subgraphs in dense hypergraphs
by: Montgomery, Richard, et al.
Published: (2023)

Sharp thresholds for spanning regular subgraphs
by: Zhukovskii, Maksim
Published: (2025)

On the size of universal graphs for spanning trees
by: Kim, Jaehoon, et al.
Published: (2025)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

Random choice spanning trees
by: Archer, Eleanor, et al.
Published: (2024)