Journal Article10.1007/BF02024498
On maximal paths and circuits of graphs
907
About: This article is published in Acta Mathematica Hungarica. The article was published on 01 Sep 1959.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Digraphs containing every possible pair of dicycles
TL;DR: In this article, the minimum degree of a directed graph of order n ≥ 4 was shown to be at least (3n − 3n − 2)-2, where n is the number of vertices in the graph.
3
Rainbow Matchings in Properly-Colored Hypergraphs
Hao Huang,Tong Li,Guanghui Wang +2 more
TL;DR: In this article, it was shown that if the edges incident to each vertex have distinct colors, then there exists a rainbow matching of size $s, containing one edge from each vertex.
Three Results on Cycle-Wheel Ramsey Numbers
TL;DR: The knowledge on exact values of Ramsey numbers is expanded in three directions: large cycles versus wheels of odd order; large wheels versus cycles of even order; andLarge cycles versus generalized odd wheels.
The Turán Number of Spanning Star Forests
TL;DR: In this article, Wang, Yang, Ning and Ning showed that when 1 ≤ k ≤ n−1, ex(n,Sn,k) = ⌊ k−1 2 ⌋.
3
References
On the structure of linear graphs
Paul Erdös,A. H. Stone +1 more
TL;DR: The first result in this direction was due to Turân as discussed by the authors, who proved that a graph with kn vertices and Ck, 2n+1 edges always contains a complete graph of order k + 1.