Cover Image

Embedding trees using minimum and maximum degree conditions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pokrovskiy, Alexey, Versteegen, Leo, Williams, Ella
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers
by: Pokrovskiy, Alexey, et al.
Published: (2024)

On the gracesize of trees
by: Letzter, Shoham, et al.
Published: (2025)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

Relative Turán densities for ordered graphs: all and nothing
by: Illingworth, Freddie, et al.
Published: (2025)

Upper bounds for linear graph codes
by: Versteegen, Leo
Published: (2023)

Notes on embedding trees in graphs with O(|T|)-sized covers
by: Pokrovskiy, Alexey
Published: (2024)

Bounded diameter monochromatic component covers
by: Pokrovskiy, Alexey
Published: (2025)

Improved bounds for the dimension of divisibility
by: Souza, Victor, et al.
Published: (2022)

On the maximum $σ$-irregularity of trees with given order and maximum degree
by: Bašić, Milan
Published: (2026)

Size-Ramsey numbers of tight paths
by: Letzter, Shoham, et al.
Published: (2025)

Chi-boundedness of graphs containing no cycles with $k$ chords
by: Lee, Joonkyung, et al.
Published: (2022)

Hyperstability in the Erdős-Sós Conjecture
by: Pokrovskiy, Alexey
Published: (2024)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
by: Zhang, Leilei
Published: (2024)

Around the positive graph conjecture
by: Conlon, David, et al.
Published: (2024)

Packing and finding paths in sparse random graphs
by: Iršič, Vesna, et al.
Published: (2024)

Hamiltonicity and structure of connected biclaw-free graphs
by: Pokrovskiy, Alexey, et al.
Published: (2025)

Exact minimum co-degree conditions for $\ell$-Hamiltonicity in hypergraphs
by: Gan, Luyining, et al.
Published: (2026)

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

Approximate path decompositions of regular graphs
by: Montgomery, Richard, et al.
Published: (2024)

Decomposing cubic graphs into isomorphic linear forests
by: Kronenberg, Gal, et al.
Published: (2022)

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

The sandglass conjecture beyond cancellative pairs
by: Mond, Adva, et al.
Published: (2025)

Spanning trees with large maximum degrees
by: Yan, Jun
Published: (2025)

On the Graham--Sloane harmonious labelling conjecture
by: Müyesser, Alp, et al.
Published: (2025)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)

An exploration of the balance game
by: Dorbec, Paul, et al.
Published: (2024)

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

Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
by: Li, Peishan
Published: (2025)

Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
by: Zhang, Zhenhao, et al.
Published: (2026)

A note on degree conditions for Ramsey goodness of trees
by: Luo, Zhidan, et al.
Published: (2025)

Identifying open codes in trees and 4-cycle-free graphs of given maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)

On Independent Spanning Trees in Random and Pseudorandom Graphs
by: Draganić, Nemanja, et al.
Published: (2025)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
by: Zhong, Jiaxu, et al.
Published: (2026)

Tight minimum colored degree condition for rainbow connectivity
by: Czygrinow, Andrzej, et al.
Published: (2024)

A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
by: Deniz, Zakir, et al.
Published: (2025)

A random Hall-Paige conjecture
by: Müyesser, Alp, et al.
Published: (2022)

Hypergraph independence bounds: from maximum degree to average degree
by: Yu, Jing, et al.
Published: (2026)

Size, diversity, minimum degree, sturdiness, dömdödöm
by: Patkós, Balázs
Published: (2025)