Extremal infinite graph theory
From MaRDI portal
Publication:2275380
DOI10.1016/j.disc.2010.12.018zbMath1223.05200arXiv1102.0697OpenAlexW2091084011MaRDI QIDQ2275380
Publication date: 8 August 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.0697
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40) Infinite graphs (05C63)
Related Items (11)
Extending cycles locally to Hamilton cycles ⋮ Characterising \(k\)-connected sets in infinite graphs ⋮ Excluding a full grid minor ⋮ Infinite Ramsey-minimal graphs for star forests ⋮ An analogue of Edmonds' branching theorem for infinite digraphs ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ An advance in infinite graph models for the analysis of transportation networks ⋮ Forcing finite minors in sparse infinite graphs by large-degree assumptions ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Infinite matroids in graphs ⋮ The relative degree and large complete minors in infinite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On infinite cycles. I, II
- On a packing problem for infinite graphs and independence spaces
- Mader's conjecture on extremely critical graphs
- Connectivity keeping edges in graphs with large minimum degree
- A weaker version of Lovász' path removal conjecture
- Kritisch n-fach kantenzusammenhängende Graphen. (Critically n-edge- connected graphs)
- Paths in graphs, reducing the edge-connectivity only by two
- On critically h-connected simple graphs
- Endlichkeitssätze für k-kritische Graphen
- On \(k\)-con-critically \(n\)-connected graphs
- The extremal function for complete minors
- Topological paths, cycles and spanning trees in infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- Arboricity and tree-packing in locally finite graphs
- Hamilton circles in infinite planar graphs
- Infinite Hamilton cycles in squares of locally finite graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Über den Zusammenhang symmetrischer Graphen
- Unendliche minimale \(n\)-fach zusammenhängende Graphen
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- Hamiltonian lines in infinite graphs with few vertices of smll valency
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- Forcing Large Complete (Topological) Minors in Infinite Graphs
- Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Forcing highly connected subgraphs
- Hamilton Cycles in Planar Locally Finite Graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Nonseparating cycles inK-Connected graphs
- The Cycle Space of an Infinite Graph
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- Infinite paths in planar graphs V, 3‐indivisible graphs
- Critically n-Connected Graphs
- Minimally n-line connected graphs.
- Eine Eigenschaft der Atome endlicher Graphen
This page was built for publication: Extremal infinite graph theory
