On a conjecture of Bondy (Q1065023): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Stefan Mititelu / rank | |||
Property / reviewed by | |||
Property / reviewed by: Stefan Mititelu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(85)90035-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031573311 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3921262 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:09, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a conjecture of Bondy |
scientific article |
Statements
On a conjecture of Bondy (English)
0 references
1985
0 references
The authors prove the following conjecture of Bondy: if G is a k- connected graph, where \(k\geq 2\), such that the degree-sum of any \(k+1\) independent vertices is at least m, then G contains a cycle of length at least \(\min (2m/(k+1),n)\) (n denotes the order of G).
0 references
cycle
0 references