Lower bound of the Hadwiger number of graphs by their average degree

Recommendations

The average lower domination number of graphs
Average lower domination number of graphs
On the average lower bondage number of a graph
On the average lower independence number of some graphs
A lower bound on the average size of a connected vertex set of a graph
The average lower independence number of total graphs
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
The average lower connectivity of graphs
scientific article; zbMATH DE number 3865318
On average lower independence and domination numbers in graphs

Cites work

Beweis einer Abschwächung der Hadwiger-Vermutung
Contractions of graphs: A theorem of Ore and an extremal problem
Homomorphiesätze für Graphen
scientific article; zbMATH DE number 3482343 (Why is no real title available?)
scientific article; zbMATH DE number 3102312 (Why is no real title available?)
On some graph-theoretical problems of V. G. Vizing
On the minimum of the Hadwiger number for graphs with a given mean degree of vertices

Cited in

(only showing first 100 items - show all)

Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
Approximating the maximum clique minor and some subgraph homeomorphism problems
Linear connectivity forces large complete bipartite minors
Note on coloring graphs without odd-\(K_k\)-minors
List-coloring graphs without \(K_{4,k}\)-minors
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
Hadwiger's conjecture is true for almost every graph
The Hadwiger number of infinite vertex-transitive graphs
Tournaments as strong subcontractions
The extremal function for unbalanced bipartite minors
On the purity of minor-closed classes of graphs
The extremal function for Petersen minors
A better lower bound on average degree of online \(k\)-list-critical graphs
The extremal function and Colin de Verdière graph parameter
On \(K_{s,t}\)-minors in graphs with given average degree. II
The extremal function for complete minors
High-girth graphs avoiding a minor are nearly bipartite
The Colin de Verdière parameter, excluded minors, and the spectral radius
Packing and covering balls in graphs excluding a minor
On the hat guessing number of graphs
Additive non-approximability of chromatic number in proper minor-closed classes
Immersion and clustered coloring
Connectivity and choosability of graphs with no \(K_t\) minor
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
Large immersions in graphs with independence number 3 and 4
A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
Some remarks on even-hole-free graphs
Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
Clique immersion in graphs without a fixed bipartite graph
A lower bound on the average degree forcing a minor
Local search is a PTAS for feedback vertex set in minor-free graphs
Asymptotic density of graphs excluding disconnected minors
Chromatic number, induced cycles, and non-separating cycles
On the Hadwiger number of Kneser graphs and their random subgraphs
The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
Tuza's conjecture for graphs with maximum average degree less than 7
Allowing each node to communicate only once in a distributed system: shared whiteboard models
On the average crosscap number. II: Bounds for a graph
Boxicity of graphs on surfaces
The extremal function for disconnected minors
On the number of cliques in graphs with a forbidden minor
Minors in graphs of large _r-girth
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
Fractional coloring and the odd Hadwiger's conjecture
The extremal function for \(K_{9}\) minors
Lift-contractions
On the odd-minor variant of Hadwiger's conjecture
Average degree conditions forcing a minor
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
Clique immersions and independence number
Graph theory. Abstracts from the workshop held January 2--8, 2022
Breaking the degeneracy barrier for coloring graphs with no K_t minor
Rainbow Turán number of clique subdivisions
Properties of 8-contraction-critical graphs with no K₇ minor
A structure theorem for strong immersions
Hadwiger's conjecture
Rumor spreading with no dependence on conductance
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
Cliques in graphs excluding a complete graph minor
Small complete minors above the extremal edge density
Short proofs of some extremal results. II.
Coloring immersion-free graphs
scientific article; zbMATH DE number 3865318 (Why is no real title available?)
An extremal function for contractions of graphs
Cycles of Given Size in a Dense Graph
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
A relative of Hadwiger's conjecture
Brooks' Theorem and Beyond
A Weakening of the Odd Hadwiger's Conjecture
Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
scientific article; zbMATH DE number 3935073 (Why is no real title available?)
A minimum degree condition forcing complete graph immersion
On the graph complement conjecture for minimum rank
Small minors in dense graphs
On the size of identifying codes in triangle-free graphs
The saga of minimum spanning trees
Minors in graphs of large girth
Additive non-approximability of chromatic number in proper minor-closed classes
Treewidth versus clique number. I: Graph classes with a forbidden structure
Tree densities in sparse graph classes
Computation of Hadwiger number and related contraction problems. Tight lower bounds
Complete Minors in Graphs Without Sparse Cuts
Counting Small Induced Subgraphs Satisfying Monotone Properties
Constant congestion brambles in directed graphs
The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
Logarithmically small minors and topological minors
Ramsey numbers of cubes versus cliques
Improper colouring of graphs with no odd clique minor
Circumference and pathwidth of highly connected graphs
Forcing a sparse minor
A tight Erdős-Pósa function for wheel minors
Average degree and contractibility
Colouring planar graphs with three colours and no large monochromatic components
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
List-coloring graphs without subdivisions and without immersions
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
Extremal functions for sparse minors

This page was built for publication: Lower bound of the Hadwiger number of graphs by their average degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760439)