A minimax theorem for infinite graphs with ideal points

DOI10.1016/0012-365X(92)90039-IzbMath0772.05061OpenAlexW2020345516MaRDI QIDQ1196749

Norbert Polat

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90039-i

zbMATH Keywords

minimax theoremendsinfinite graphs\(A\)-path\(A\)-separator

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (1)

Minimax theorems for infinite graphs with the ends as ideal points

Cites Work

• A Mengerian theorem for infinite graphs with ideal points
• Über die Maximalzahl kreuzungsfreier H-Wege
• Aspects topologiques de la séparation dans les graphes infinis. I. II
• A note on Menger's theorem for infinite locally finite graphs
• Über unendliche Wege in Graphen
• A selection lemma
• Über die Enden diskreter Räume und Gruppen
• Développements terminaux des graphes infinis I. Arbres maximaux coterminaux
• Improper vertices of a graph

This page was built for publication: A minimax theorem for infinite graphs with ideal points