Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
Hamiltonian cycles
pancyclic graphs |
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bondy–Erdős theorem
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:John_Adrian_Bondy |
| gptkbp:publicationYear |
1972
|
| gptkbp:publishedIn |
gptkb:Journal_of_Combinatorial_Theory,_Series_B
|
| gptkbp:state |
If a graph with n vertices is Hamiltonian and has more than n^2/4 edges, then it is pancyclic.
|
| gptkbp:bfsParent |
gptkb:G._H._Bondy
|
| gptkbp:bfsLayer |
7
|