Minors in graphs of large \(\theta_r\)-girth
type: Item
instance of: scholarly article
title: Minors in graphs of large \(\theta_r\)-girth
zbMATH Open document ID: 1369.05187
author: Dimitris Chatzidimitriou
author: Jean-Florent Raymond
author: Ignasi Sau
author: Dimitrios M. Thilikos
published in: European Journal of Combinatorics
publication date: 2017-08-31T00:00:00Z
full work available at URL: https://arxiv.org/abs/1510.03041
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6767270
zbMATH Keywords: girth
zbMATH Keywords: clique-minors
MaRDI profile type: Publication
OpenAlex ID: W2405772563
arXiv ID: 1510.03041
cites work: New spectral lower bounds on the bisection width of graphs
cites work: Q3424767
cites work: On Linear Time Minor Tests with Depth-First Search
cites work: (Meta) Kernelization
cites work: On interval routing schemes and treewidth
cites work: Girth and treewidth
cites work: Large-treewidth graph decompositions and applications
cites work: Polynomial bounds for the grid-minor theorem
cites work: Excluded Grid Theorem
cites work: Highly connected sets and the excluded grid theorem
cites work: On tree-partitions of graphs
cites work: A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph
cites work: Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
cites work: Minors in random regular graphs
cites work: On the excluded minors for the matroids of branch-width \(k\)
cites work: Tree-partitions of infinite graphs
cites work: The branchwidth of graphs and their cycle matroids
cites work: Complete graph minors and the graph minor structure theorem
cites work: Lower bound of the Hadwiger number of graphs by their average degree
cites work: Minors in graphs of large girth
cites work: Complete minors in \(K_{s,s}\)-free graphs
cites work: Q5475537
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: Q3135082
cites work: Topics in Matroid Theory
cites work: Low Polynomial Exclusion of Planar Graph Patterns
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Quickly excluding a planar graph
cites work: Q3692864
cites work: Q4715286
cites work: An extremal function for contractions of graphs
cites work: The extremal function for complete minors
cites work: Isomorphism for graphs of bounded distance width
DOI: 10.1016/J.EJC.2017.04.011
description: scientific article