Decomposing tournaments into paths

Electronic Notes in Discrete Mathematics - Tập 61 - Trang 813-818 - 2017
Allan Lo1
1School of Mathematics, University of Birmingham, Birmingham, UK

Tài liệu tham khảo

Alspach, 1976, Path numbers of tournaments, J. Combin. Theory B, 20, 222, 10.1016/0095-8956(76)90013-7

Alspach, 1974, Path decompositions of digraphs, Bull. Austral. Mat. Soc., 10, 421, 10.1017/S0004972700041101

Bang-Jensen, 2000

Csaba, 2016, Proof of the 1-factorization and Hamilton decomposition conjectures, Mem. Amer. Math. Soc., 244

Glock

Huang, 2013, Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs, Combin. Probab. Comput., 22, 859, 10.1017/S0963548313000394

Keevash

Kühn, 2013, Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments, Adv. Math., 237, 62, 10.1016/j.aim.2013.01.005

Kühn, 2014, Hamilton decompositions of regular expanders: applications, J. Combin. Theory Ser. B, 104, 1, 10.1016/j.jctb.2013.10.006

Krivelevich, 1997, Triangle factors in random graphs, Combin. Probab. Comput., 6, 337, 10.1017/S0963548397003106

O'Brien, 1977, An upper bound on the path number of digraphs, J. Combin. Theory Ser. B, 22, 168, 10.1016/0095-8956(77)90009-0

Rödl, 2006, A Dirac-type theorem for 3-uniform hypergraphs, Combin. Probab. Comput., 15, 229, 10.1017/S0963548305007042

Thông tin
Thông tin xuất bản

Electronic Notes in Discrete Mathematics

Tập 61

813-818

Thông tin tác giả