How to build a pillar: a proof of Thomassen's conjecture (Q6170787): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cycles Modulo <i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / 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: Vertex-disjoint cycles of the same length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion in supercritical random subgraphs of the hypercube and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Proof of Conjectures on Cycle Lengths in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested cycles with no geometric crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal density for sparse minors and subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crux and Long Cycles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers of cycles versus general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Komlós's conjecture on Hamiltonian subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques in graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanders – how to find them, and what to find in them / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in random graphs: A simple proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Mader's conjecture on large clique subdivisions in C4-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to Erdős and Hajnal’s odd cycle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique immersion in graphs without a fixed bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Turán function of even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense graphs without 3-regular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Arithmetic Progressions of Cycle Lengths in Graphs / rank
 
Normal rank

Revision as of 13:24, 2 August 2024

scientific article; zbMATH DE number 7725322
Language Label Description Also known as
English
How to build a pillar: a proof of Thomassen's conjecture
scientific article; zbMATH DE number 7725322

    Statements

    How to build a pillar: a proof of Thomassen's conjecture (English)
    0 references
    0 references
    0 references
    10 August 2023
    0 references
    cycles
    0 references
    paths
    0 references
    expander graphs
    0 references
    average degree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references