Nonempty intersection of longest paths in a graph with a small matching number
- 92 Downloads
A maximum matching of a graph G is a matching of G with the largest number of edges. The matching number of a graph G, denoted by α′(G), is the number of edges in a maximum matching of G. In 1966, Gallai conjectured that all the longest paths of a connected graph have a common vertex. Although this conjecture has been disproved, finding some nice classes of graphs that support this conjecture is still very meaningful and interesting. In this short note, we prove that Gallai’s conjecture is true for every connected graph G with α′(G) ⩽ 3.
Keywordslongest path matching number
MSC 201005C38 05C70 05C75
Unable to display preview. Download preview PDF.
- J. Ehrenmüller, C. G. Fernandes, C. G. Heise: Nonempty intersection of longest paths in series-parallel graphs. Preprint 2013, arXiv:1310. 1376v2.Google Scholar
- T. Gallai: Problem 4. Theory of Graphs (P. Erdős et al., eds.). Proceedings of the Colloquium on Graph Theory, held at Tihany, Hungary, 1966, Academic Press, New York; Akadémiai Kiadó, Budapest, 1968.Google Scholar
- D. B. West: Open Problems—Graph Theory and Combinatorics, Hitting All Longest Paths. http://www.math.uiuc.edu/~west/openp/pathtran.html, accessed in January 2013.