Cover Image

Building graphs with high minimum degree on a budget

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Katsamaktsis, Kyriakos, Letzter, Shoham
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Rainbow subgraphs of uniformly coloured randomly perturbed graphs
by: Katsamaktsis, Kyriakos, et al.
Published: (2023)

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
by: Katsamaktsis, Kyriakos, et al.
Published: (2023)

Exact supported co-degree bounds for Hamilton cycles
by: Letzter, Shoham, et al.
Published: (2025)

Partitioning a tournament into sub-tournaments of high connectivity
by: Girão, António, et al.
Published: (2022)

Sublinear expanders and their applications
by: Letzter, Shoham
Published: (2024)

Separating paths systems of almost linear size
by: Letzter, Shoham
Published: (2022)

Leaf-to-leaf paths and cycles in degree-critical graphs
by: Di Braccio, Francesco, et al.
Published: (2025)

Packing subgraphs in regular graphs
by: Letzter, Shoham, et al.
Published: (2025)

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

On a problem of Brown, Erdős and Sós
by: Letzter, Shoham, et al.
Published: (2023)

Directed cycles with zero weight in $\mathbb{Z}_p^k$
by: Letzter, Shoham, et al.
Published: (2023)

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

Leaf-to-leaf paths of many lengths
by: Di Braccio, Francesco, et al.
Published: (2025)

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

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

Nearly Hamilton cycles in sublinear expanders, and applications
by: Letzter, Shoham, et al.
Published: (2025)

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

Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
by: Di Braccio, Francesco, et al.
Published: (2026)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

The rainbow saturation number is linear
by: Behague, Natalie, et al.
Published: (2022)

Bipartite graphs with minimum degree at least 15 are antimagic
by: Deng, Kecai
Published: (2025)

Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

A parameterized algorithm for $K_r$-factors in graphs of high minimum degree
by: Gan, Luyining, et al.
Published: (2023)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
by: Attwa, Yamaan, et al.
Published: (2025)

On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)

Paired domination in graphs with minimum degree four
by: Bujtás, Csilla, et al.
Published: (2025)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

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

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

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

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

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
by: DeBiasio, Louis, et al.
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)

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

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

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

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
by: Zhang, Yiran, et al.
Published: (2023)