A note on Hamilton <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e433" altimg="si28.svg"><mml:mi>ℓ</mml:mi></mml:math>-cycle decomposition of complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e438" altimg="si29.svg"><mml:mi>k</mml:mi></mml:math>-partite hypergraphs

Similar Works

Action	Title	Year	Authors
+	On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e290" altimg="si371.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-Hamilton-connected graphs	2023	Tianjiao Dai Hao Li Qiancheng Ouyang Zeng-Xian Tian
+	Complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-partite subgraphs of dense <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-graphs	2009	Vladimir Nikiforov
+	Coloring <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e23" altimg="si13.svg"><mml:mi>k</mml:mi></mml:math>-partite sparse digraphs	2024	Ararat Harutyunyan Louisa Harutyunyan Narek Hovhannisyan
+	Maximal sets of Hamilton cycles in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e21" altimg="si9.svg"><mml:mrow><mml:mi>K</mml:mi><mml:mfenced open="(" close=")"><mml:mrow><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi></mml:mrow></mml:msup><mml:mo>;</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow…	2020	Mustafa Demir C.A. Rodger
+ PDF Chat	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>M</mml:mi></mml:math>-alternating Hamilton paths and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>M</mml:mi></mml:math>-alternating Hamilton cycles	2008	Zan‐Bo Zhang Yueping Li Dingjun Lou
+	Perfect matching and Hamilton cycle decomposition of complete balanced <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo linebreak="goodbreak">+</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-partite k-uniform hypergraphs	2020	Yi Zhang Mei Lu Ke Liu
+ PDF Chat	Hamiltonian cycles in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-circulant digraphs	2009	Dave Witte Morris Joy Morris Kerri Webb
+	Maximal sets of Hamilton cycles in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>	2007	Liqun Pu Hung‐Lin Fu Hao Shen
+	Hamiltonian decompositions of complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs	2009	R. A. Bailey Brett Stevens
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml81" display="inline" overflow="scroll" altimg="si81.gif"><mml:mn>2</mml:mn><mml:mi>p</mml:mi></mml:math>-cycle decompositions of some regular graphs and digraphs	2018	S. Ganesamurthy P. Paulraja
+	Hamiltonicity of 2-connected <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mo stretchy="false">{</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>e</mml:mi><mml:mo stretchy="…	2004	Rao Li
+ PDF Chat	A note on the Hamilton–Waterloo problem with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>8</mml:mn></mml:mrow></mml:msub></mml:math>-factors and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml2" display="inline" overflow="scroll" altimg="si2.gif"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml…	2017	Liuping Wang H. Cao
+	The threshold for the square of a Hamilton cycle	2020	Jeff Kahn Bhargav Narayanan Jinyoung Park
+	On cyclic Hamiltonian decompositions of complete<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs	2014	Paweł Petecki
+ PDF Chat	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si178.svg" display="inline" id="d1e3412"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-core decomposition of hypergraphs	2023	Jongshin Lee K.-I. Goh Deok‐Sun Lee B. Kahng
+	<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si19.gif" display="inline" overflow="scroll"><mml:mi>ϕ</mml:mi></mml:math>-symmetric Hamilton cycle decompositions of graphs	2015	Michael W. Schroeder
+	Toughness and prism-hamiltonicity of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e20" altimg="si14.svg"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs	2020	M. N. Ellingham Pouria Salehi Nowbandegani Songling Shan
+	Every 3-connected <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e174" altimg="si6.svg"><mml:mrow><mml:mo>{</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>Z</mml:mi></mml:mrow><mml:mrow><mml:mn>7</mml:mn></mml:mrow></mml:msub><mml:mo>}</mml:mo></mml:mrow></mml:math>-free graph of order at least 21 is Hamilton-connected	2021	Zdeněk Ryjáček Petr Vrána
+	Competition numbers of complete <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>r</mml:mi></mml:math>-partite graphs	2012	Bo-Jr Li Gerard J. Chang
+	On the Turán numbers of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mrow><mml:mi>k</mml:mi><mml:msub><mml:mi>K</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow></mml:math> in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.svg"><mml:mi>ℓ</mml:mi></mml:math>-partite graphs	2021	Guangming Li Jianhua Yin

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (19)

Action	Title	Year	Authors
+	Dirac-type results for loose Hamilton cycles in uniform hypergraphs	2009	Hiệp Hàn Mathias Schacht
+	Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs	2011	Vojtěch Rödl Andrzej Ruciński Endre Szemerédi
+	Decompositions of complete uniform hypergraphs into Hamilton Berge cycles	2014	Daniela Kühn Deryk Osthus
+	Loose Hamilton cycles in hypergraphs	2011	Peter Keevash Daniela Kühn Richard Mycroft Deryk Osthus
+ PDF Chat	Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs	2013	Enno Buß Hiệp Hàn Mathias Schacht
+	Hamilton ℓ-cycles in uniform hypergraphs	2010	Daniela Kühn Richard Mycroft Deryk Osthus
+	Recent Advances on the Hamiltonian Problem: Survey III	2013	Ronald J. Gould
+	Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree	2006	Daniela Kühn Deryk Osthus
+	Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs	2015	Jie Han Yi Zhao
+	Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments	2013	Daniela Kühn Deryk Osthus