:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Huang, Ting, Zhang, Yanbo, Chen, Yaojun
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2507.03264
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fan-goodness of sparse graphs
by: Huang, Ting, et al.
Published: (2025)

Ramsey numbers of sparse graphs versus disjoint books
by: Huang, Ting, et al.
Published: (2025)

Trichotomy and $tK_m$-goodness of sparse graphs
by: Zhang, Yanbo, et al.
Published: (2025)

New bounds for Ramsey numbers involving graphs with a center
by: Zhang, Yanbo, et al.
Published: (2026)

Color-avoiding connected spanning subgraphs with minimum number of edges
by: Pintér, József, et al.
Published: (2023)

Ramsey numbers and Gallai--Ramsey numbers of disjoint unions of cherries
by: Zhang, Yanbo, et al.
Published: (2026)

Disproofs of four Gallai-Ramsey-type conjectures
by: Zhang, Yanbo, et al.
Published: (2024)

Spanning tree-connected subgraphs with small degrees
by: Hasanvand, Morteza
Published: (2022)

Highly connected graphs have highly connected spanning bipartite subgraphs
by: Yuster, Raphael
Published: (2024)

Characterizing forbidden pairs for spanning $\varTheta$-subgraphs of 2-connected graphs
by: Li, Binlong, et al.
Published: (2025)

Oriented Ramsey numbers of some sparse graphs
by: Lu, Junying, et al.
Published: (2024)

Rainbow copies of spanning subgraphs
by: Cooper, Colin, et al.
Published: (2025)

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

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

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

From finding a spanning subgraph $H$ to an $H$-factor
by: Lo, Allan
Published: (2025)

Random Turán theorem for expansions of spanning subgraphs of tight trees
by: Nie, Jiaxi
Published: (2023)

Sufficient average degree conditions for the existence of large highly connected subgraphs
by: Krone, Maximilian
Published: (2025)

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

Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)

The existence of biregular spanning subgraphs in bipartite graphs via spectral radius
by: Fan, Dandan, et al.
Published: (2024)

Unavoidable subgraphs in digraphs with large out-degrees
by: Hons, Tomáš, et al.
Published: (2025)

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

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

Decompositions of graphs with degree constraints relative to prescribed subgraphs
by: Wei, Peichao, et al.
Published: (2025)

More Ramsey theory for highly connected monochromatic subgraphs
by: Hrušák, Michael, et al.
Published: (2023)

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
by: Chen, Yihan, et al.
Published: (2024)

On the maximum degree of induced subgraphs of the Kneser graph
by: Chau, Hou Tin, et al.
Published: (2023)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

On the threshold Ramsey multiplicity conjectures for paths and even cycles
by: Huang, Ting, et al.
Published: (2026)

A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)

Oriented diameter of graphs with given domination number
by: Wang, Xiaolin, et al.
Published: (2025)

Highly connected orientations from edge-disjoint rigid subgraphs
by: Garamvölgyi, Dániel, et al.
Published: (2024)

A stability theorem for embedding bounded degree spanning trees
by: Csaba, Béla
Published: (2026)

$C_4$-free subgraphs of high degree with geometric applications
by: Hunter, Zach, et al.
Published: (2025)

Inverse model for network construction: (δ(G), I' (G)) -> G
by: Gao, Wei, et al.
Published: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

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