An extremal function for contractions of graphs
From MaRDI portal
Publication:3344229
Recommendations
Cited in
(only showing first 100 items - show all)- Disjoint \(K_{r}\)-minors in large graphs with given average degree
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- Property testing of massively parametrized problems -- a survey
- Connectivity and choosability of graphs with no \(K_t\) minor
- Immersion and clustered coloring
- Improved bound for improper colourings of graphs with no odd clique minor
- Separators in region intersection graphs
- The extremal function and Colin de Verdière graph parameter
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor
- Average degree conditions forcing a minor
- The extremal function for disconnected minors
- scientific article; zbMATH DE number 4053652 (Why is no real title available?)
- On a relationship between Hadwiger and stability numbers
- Forcing a sparse minor
- Allowing each node to communicate only once in a distributed system: shared whiteboard models
- Extremal density for sparse minors and subdivisions
- Minors in graphs of large girth
- On nowhere dense graphs
- On a recolouring version of Hadwiger's conjecture
- The edge-density for \(K_{2,t}\) minors
- Product structure of graph classes with bounded treewidth
- Partial result on Hadwiger's conjecture
- Forcing unbalanced complete bipartite minors
- Dense graphs have \(K_{3,t}\) minors
- Local Hadwiger's conjecture
- The degree-diameter problem for sparse graph classes
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- On the Hadwiger's conjecture for graph products
- On \(K_{s,t}\)-minors in graphs with given average degree
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Colouring planar graphs with three colours and no large monochromatic components
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
- Contractibility and the Hadwiger conjecture
- Linear connectivity forces large complete bipartite minors
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
- Colouring graphs with bounded generalized colouring number
- Some remarks on even-hole-free graphs
- A relaxed Hadwiger's conjecture for list colorings
- Polynomial treewidth forces a large grid-like-minor
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
- Large immersions in graphs with independence number 3 and 4
- Some remarks on the odd Hadwiger's conjecture
- The extremal function for unbalanced bipartite minors
- Isomorphism Testing for Graphs Excluding Small Minors
- Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor
- Graphs without minor complete subgraphs
- Hadwiger number and the Cartesian product of graphs
- Complete directed minors and chromatic number
- Extremal functions for sparse minors
- On the extremal function for graph minors
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- The extremal function for complete minors
- Tree densities in sparse graph classes
- Fractional colouring and Hadwiger's conjecture
- 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
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density
- The extremal function for 3-linked graphs
- Small minors in dense graphs
- Rank-width and tree-width of \(H\)-minor-free graphs
- Linkages and removable paths avoiding vertices
- Improved lower bound for the list chromatic number of graphs with no Kt minor
- Surfaces, tree-width, clique-minors, and partitions
- The saga of minimum spanning trees
- Constant congestion brambles in directed graphs
- A relative of Hadwiger's conjecture
- Some recent progress and applications in graph minor theory
- Coloring immersion-free graphs
- Short proofs of some extremal results. II.
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs
- Logarithmically small minors and topological minors
- The extremal function for Petersen minors
- An improved linear edge bound for graph linkages
- Rainbow Turán number of clique subdivisions
- Large simple \(d\)-cycles in simplicial complexes
- Complete minors and average degree: A short proof
- Strong complete minors in digraphs
- List-coloring graphs without \(K_{4,k}\)-minors
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes
- Sublinear separators, fragility and subexponential expansion
- Grad and classes with bounded expansion. I: Decompositions
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- Linear transformations between dominating sets in the TAR-model
- Clique minors in graphs with a forbidden subgraph
- The extremal function for \(K_{9}\) minors
- Metric uniformization and spectral bounds for graphs
- On the maximum number of cliques in a graph
- Edge separators for graphs excluding a minor
- Recent progress towards Hadwiger's conjecture
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- On the choosability of \(H\)-minor-free graphs
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Circumference and pathwidth of highly connected graphs
- On the contractibility of a digraph onto \(K_ 4^*\)
- Hadwiger's conjecture
- On the odd-minor variant of Hadwiger's conjecture
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)
