An extremal function for contractions of graphs
From MaRDI portal
Recommendations
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
- Hadwiger number and the Cartesian product of graphs
- 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
- Structure and recognition of graphs with no 6-wheel subdivision
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Colouring graphs with bounded generalized colouring number
- On a relationship between Hadwiger and stability numbers
- On the contractibility of a digraph onto \(K_ 4^*\)
- Tournaments as strong subcontractions
- The extremal function for unbalanced bipartite minors
- Fractional colouring and Hadwiger's conjecture
- Clique minors in graphs and their complements
- The extremal function for Petersen minors
- The extremal function and Colin de Verdière graph parameter
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- Disjoint \(K_{r}\)-minors in large graphs with given average degree
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- An improved linear edge bound for graph linkages
- Pseudo-random hypergraphs
- Surfaces, tree-width, clique-minors, and partitions
- 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
- 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
- A lower bound on the average degree forcing a minor
- Asymptotic density of graphs excluding disconnected minors
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
- Allowing each node to communicate only once in a distributed system: shared whiteboard models
- 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
- Grad and classes with bounded expansion. I: Decompositions
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- On nowhere dense graphs
- Fractional coloring and the odd Hadwiger's conjecture
- The extremal function for \(K_{9}\) minors
- Proper minor-closed families are small
- Lift-contractions
- On the odd-minor variant of Hadwiger's conjecture
- Highly linked graphs
- 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
- Phase transition of degeneracy in minor-closed families
- 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
- Hadwiger's conjecture
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
- Partial result on Hadwiger's conjecture
- 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
- Extremal Functions for Shortening Sets of Paths
- Number of cliques in graphs with a forbidden subdivision
- 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
- Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
- scientific article; zbMATH DE number 4053652 (Why is no real title available?)
- Small minors in dense graphs
- The saga of minimum spanning trees
- Separators in region intersection graphs
- Minors in graphs of large girth
- An extremal function for digraph subcontraction
- The degree-diameter problem for sparse graph classes
- Property testing of massively parametrized problems -- a survey
- Tree densities in sparse graph classes
- Complete Minors in Graphs Without Sparse Cuts
- Constant congestion brambles in directed 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
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- Forcing a sparse minor
- A tight Erdős-Pósa function for wheel minors
- Colouring planar graphs with three colours and no large monochromatic components
- 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
- Improved bound for improper colourings of graphs with no odd clique minor
- Isomorphism Testing for Graphs Excluding Small Minors
- Large complete minors in random subgraphs
This page was built for publication: An extremal function for contractions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344229)
