No label defined (Q4040392)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 193589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 193589 |
Statements
5 June 1993
0 references
regular minimum degree
0 references
triangle-free
0 references
cycle
0 references
circumference
0 references
0.9421682
0 references
0.93427587
0 references
0.9265997
0 references
0.92627054
0 references
0.9177976
0 references
0.91674256
0 references
0.91593623
0 references
0.9157598
0 references
The first chapter of this thesis concerns cycles in triangle-free graphs. It is shown that for any longest cycle C in a 2-connected, triangle-free graph G, if \(| G| \leq 6\delta -5,\) then G-C has at most one edge. It is proved in chapter 2 that any longest cycle in a 2-connected, \(\delta\)-regular, bipartite graph on at most \(6\delta\)-6 vertices is dominating. The result in chapter 3 is that the circumference of any 4-connected, \(\delta\)-regular graph is at least \(\min \{| G|,4\delta -4\}\) or at least \(\max \{3\delta,(| G| +3\delta -2)/2\}.\) In the last chapter, we obtain the following result: if G is a \(\delta\)- regular, bipartite graph and if either G is 2-connected with \(| G| \leq 6\delta -6\) or G is 3-connected, then the circumference is at least \(\min \{| G|,6\delta -14,\quad (| G| +10\delta - 16)/3\}.\) There are also many consequences of the above results.
0 references