Forcing a sparse minor (Q5366891): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1402.0272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted sums of certain dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-density for \(K_{2,t}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism theorems for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum density of graphs which have no subcontraction to \(K^ r\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density theorems for bipartite graphs and related Ramsey-type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractions to <i>k</i><sub>8</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K_{s,t}\)-minors in graphs with given average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs have \(K_{3,t}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(K_{s,t}\)-minors in graphs with given average degree. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing unbalanced complete bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for unbalanced bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for noncomplete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for \(K_{9}\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear edge bound for graph linkages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint complete minors and bipartite minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint unions of complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Vertex-Disjoint Cycles / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098569837 / rank
 
Normal rank

Latest revision as of 11:07, 30 July 2024

scientific article; zbMATH DE number 6788898
Language Label Description Also known as
English
Forcing a sparse minor
scientific article; zbMATH DE number 6788898

    Statements

    Forcing a sparse minor (English)
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references