Cover Image

Nordhaus-Gaddum-type theorems for maximum average degree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Caro, Yair, Tuza, Zsolt
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05B05, 05C07, 05C35
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graphs with constant links and induced Turán numbers
by: Caro, Yair, et al.
Published: (2024)

Monochromatic graph decompositions inspired by anti-Ramsey colorings
by: Caro, Yair, et al.
Published: (2024)

Nordhaus--Gaddum type bounds for the complement rank
by: Tang, Quanyu
Published: (2025)

Nordhaus-Gaddum inequalities for the number of 1-nearly independent vertex subsets
by: Andriantiana, Eric O. D., et al.
Published: (2026)

Finding dense minors using average degree
by: Hendrey, Kevin, et al.
Published: (2023)

Line graphs and Nordhaus-Gaddum-type bounds for self-loop graphs
by: Akbari, Saieed, et al.
Published: (2024)

An inverse result for Wang's theorem on extremal trees
by: Damnjanović, Ivan, et al.
Published: (2022)

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
by: Caro, Yair, et al.
Published: (2025)

Erdős meets Nash-Williams
by: Delcourt, Michelle, et al.
Published: (2025)

The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)

Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

Ore-type conditions for existence of a jellyfish in a graph
by: Kim, Jaehoon, et al.
Published: (2024)

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

On $(r,c)$-constant, planar and circulant graphs
by: Caro, Yair, et al.
Published: (2024)

On the Hypergraph Nash-Williams' Conjecture
by: Henderson, Cicely, et al.
Published: (2025)

On the maximum intersecting sets of the general semilinear group of degree $2$
by: Maleki, Roghayeh, et al.
Published: (2024)

The extremal generalised Randić index for a given degree range
by: Haslegrave, John
Published: (2024)

Greedy trees have minimum Sombor indices
by: Damnjanović, Ivan, et al.
Published: (2022)

Identifying codes in triangle-free graphs of bounded maximum degree
by: Chakraborty, Dipayan, et al.
Published: (2024)

Refinements of degree conditions for the existence of a spanning tree without small degree stems
by: Furuya, Michitaka, et al.
Published: (2023)

Uniquely $C_{4}^{+}$-saturated graphs
by: Li, Yuying, et al.
Published: (2024)

Sharp results for the Erdős, Pach, Pollack and Tuza problem
by: Cambie, Stijn, et al.
Published: (2025)

Flexible DP 3-coloring of sparse multigraphs
by: Bradshaw, Peter, et al.
Published: (2025)

Results and Problems on Equitable Coloring of Graphs
by: Kierstead, H. A., et al.
Published: (2025)

Oriented Discrepancy of The Square of Hamilton Cycles
by: Chang, Yufei, et al.
Published: (2026)

Strong Brandt-Thomassé Theorems
by: Łuczak, Tomasz, et al.
Published: (2024)

An introduction to equitable DP coloring of graphs
by: Kierstead, H. A., et al.
Published: (2026)

Sharp Bounds for Generalized Zagreb Indices of Graphs
by: Vaidya, Sanju, et al.
Published: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

On zero-sum Ramsey numbers modulo 3
by: Caro, Yair, et al.
Published: (2025)

A new strategy for finding spanning trees without small degree stems
by: Furuya, Michitaka, et al.
Published: (2023)

The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)

The $H$-linkage problems in sparse robustly expanding digraphs
by: Wang, Zhilan, et al.
Published: (2026)

Spectrum of $3$-uniform $6$- and $9$-cycle systems over $K_v^{(3)}-I$
by: Keszler, Anita, et al.
Published: (2022)

A construction of Steiner Triple Systems of type $v\longrightarrow 2v+7$
by: Bonacini, Paola, et al.
Published: (2025)

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

On the $δ$-chromatic numbers of the Cartesian products of graphs
by: Tangjai, Wipawee, et al.
Published: (2024)

The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)

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