Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 205,718,776 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

Abstract.We prove that the Hubbard model at finite temperature T and half-filling is analytic in its coupling constant λ for…

2001

2001

Menger's Theorem for digraphs states that for any two vertex sets A and B of a digraph D such that A cannot be separated from B…

2001

2001

Menger's Theorem for digraphs states that for any two vertex sets A and B of a digraph D such that A cannot be separated from B…

1995

1995

Consider a simple n-vertex undirected graph and assume there are ~ edge-disjoint paths between two vertices u and V. We prove the…

1991

1991

An(a, b)-n-fan means a union ofn internally disjoint paths. Menger's theorem states that a graphG has an(a, b)-n-fan if and only…

1984

1984

A proof of Menger’s theorem is presented. We use the notation and terminology of Bondy and Murty [ll. Let D be a directed graph…

1979

1979

Chartrand and Stewart have shown that the line graph of an n-connected graph is itself n-connected. This paper shows that for…

Highly Cited

1972

Highly Cited

1972

Introduction * Definitions and examples* Paths and cycles* Trees* Planarity* Colouring graphs* Matching, marriage and Menger's…