Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-d5zgf Total loading time: 1.391 Render date: 2021-03-08T07:23:50.808Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Cycle partitions of regular graphs

Published online by Cambridge University Press:  18 December 2020

Vytautas Gruslys
Affiliation:
Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK Email: v.gruslys@gmail.com
Shoham Letzter
Affiliation:
Department of Mathematics, University College London, Gower Street, London WC1E 6BT, UK Email: v.gruslys@gmail.com
Corresponding

Abstract

Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

Type
Paper
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below.

Footnotes

Research was supported by Dr Max Rössler, by theWalter Haefner Foundation and by the ETH Zurich Foundation.

References

Balogh, J., Mousset, F. and Skokan, J. (2017) An extension of Dirac’s theorem. Electron. J. Combin. 24 #P3.56.Google Scholar
Bollobás, B. (1978) Extremal Graph Theory. Academic Press.Google Scholar
Bollobás, B. and Hobbs, A. (1978) Hamiltonian cycles in regular graphs. Adv. Graph Theory 3 4348.10.1016/S0167-5060(08)70496-5CrossRefGoogle Scholar
Broersma, H. J., van den Heuvel, J., Jackson, B. and Veldman, H. J. (1996). Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22 105124.10.1002/(SICI)1097-0118(199606)22:2<105::AID-JGT2>3.0.CO;2-R3.0.CO;2-R>CrossRefGoogle Scholar
DeBiasio, L. and Nelsen, L. (2017) Monochromatic cycle partitions of graphs with large minimum degree. J. Combin. Theory Ser. B 122 634667.Google Scholar
Enomoto, H., Kaneko, A. and Tuza, Z. (1988) Graphs of order n and minimum degree n/4. In Combinatorics (Proc. Coll. Math. Soc. János Bolyai, Eger, 1987), pp. 213220. North-Holland.Google Scholar
Erdös, P. and Hobbs, A. M. (1978) A class of Hamiltonian regular graphs. J. Graph Theory 2 129135.10.1002/jgt.3190020205CrossRefGoogle Scholar
Fan, G. (1985) Longest cycles in regular graphs. J. Combin. Theory Ser. B 39 325345.10.1016/0095-8956(85)90058-9CrossRefGoogle Scholar
Häggkvist, R. (1978) Unsolved problems. In Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely 1976), Vol. 18 of Colloquia Mathematica Societatis János Bolyai. North-Holland.Google Scholar
Han, J. (2018) On vertex-disjoint paths in regular graphs. Electron. J. Combin. 25 #P2.12.10.37236/7109CrossRefGoogle Scholar
Hilbig, F. (1986) Kantenstrukturen in nichthamiltonischen Graphen. PhD thesis, Technical University Berlin.Google Scholar
Jackson, B. (1980) Hamilton cycles in regular 2-connected graphs. J. Combin. Theory Ser. B 29 2746.Google Scholar
Jackson, B. and Li, H. (1994) Hamilton cycles in 2-connected regular bipartite graphs. J. Combin. Theory Ser. B 62 236258.10.1006/jctb.1994.1067CrossRefGoogle Scholar
Jackson, B., Li, H. and Zhu, Y. (1992) Dominating cycles in regular 3-connected graphs. Discrete Math. 102 163176.10.1016/0012-365X(92)90051-GCrossRefGoogle Scholar
Jung, H. A. (1984) Longest circuits in 3-connected graphs. In Finite and Infinite Sets, Vol. 37 of Colloquia Mathematica Societatis János Bolyai, pp. 403438. Elsevier.Google Scholar
Kouider, M. (1994) Covering vertices by cycles. J. Graph Theory 18 757776.10.1002/jgt.3190180802CrossRefGoogle Scholar
Kouider, M. and Lonc, Z. (1996) Covering cycles and k-term degree sums. Combinatorica 16 407412.10.1007/BF01261324CrossRefGoogle Scholar
Kühn, D., Lo, A., Osthus, D. and Staden, K. (2015) The robust component structure of dense regular graphs and applications. Proc. London Math. Soc. 110 1956.Google Scholar
Kühn, D., Lo, A., Osthus, D. and Staden, K. (2016) Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. J. Combin. Theory Ser. B 121 85145.Google Scholar
Kühn, D. Mycroft, R. and Osthus, D. (2011) A proof of Sumner’s universal tournament conjecture for large tournaments. Proc. London Math. Soc. 102 731766.10.1112/plms/pdq035CrossRefGoogle Scholar
Kühn, D. Mycroft, R. and Osthus, D. (2011) An approximate version of Sumner’s universal tournament conjecture. J. Combin. Theory Ser. B 101 415447.Google Scholar
Kühn, D. and Osthus, D. (2013) Hamilton partitions of regular expanders: a proof of Kelly’s conjecture for large tournaments. Adv. Math. 237 62146.10.1016/j.aim.2013.01.005CrossRefGoogle Scholar
Kühn, D., Osthus, D. and Treglown, A. (2010) Hamiltonian degree sequences in digraphs. J. Combin. Theory Ser. B 100 367380.Google Scholar
Li, H. (2013) Generalizations of Dirac’s theorem in Hamiltonian graph theory: a survey. Discrete Math. 313 20342053.10.1016/j.disc.2012.11.025CrossRefGoogle Scholar
Lo, A. and Patel, V. (2018) Hamilton cycles in sparse robustly expanding digraphs. Electron. J. Combin. 25 #3.44.10.37236/7418CrossRefGoogle Scholar
Magnant, C. and Martin, D. (2009) A note on the path cover number of regular graphs. Australas. J. Combin. 43 211217.Google Scholar
Nash-Williams, C. St J. A. (1971) Hamiltonian arcs and circuits. In Recent Trends in Graph Theory, Vol. 186 of Lecture Notes in Mathematics, pp. 197210. Springer.10.1007/BFb0059438CrossRefGoogle Scholar
Zhu, Y. and Li, H. (1992) Hamilton cycles in regular 3-connected graphs. Discrete Math. 110 229249.10.1016/0012-365X(92)90712-OCrossRefGoogle Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 14 *
View data table for this chart

* Views captured on Cambridge Core between 18th December 2020 - 8th March 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Cycle partitions of regular graphs
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Cycle partitions of regular graphs
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Cycle partitions of regular graphs
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *