论文信息 - Disjoint perfect matchings in 3-uniform hypergraphs - 字舞流文

Disjoint perfect matchings in 3-uniform hypergraphs

Xingxing Yu | Hongliang Lu | Li Zhang

[1] Yi Zhao,et al. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs , 2015, J. Comb. Theory, Ser. A.

[2] Daniela Kühn,et al. Matchings in 3-uniform hypergraphs , 2010, J. Comb. Theory, Ser. B.

[3] Richard Mycroft. Packing k-partite k-uniform hypergraphs , 2016, J. Comb. Theory, Ser. A.

[4] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[5] Vojtech Rödl,et al. Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels , 2011, J. Comb. Theory, Ser. A.

[6] Imdadullah Khan,et al. Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree , 2011, SIAM J. Discret. Math..

[7] D. E. Daykin,et al. SETS OF INDEPENDENT EDGES OF A HYPERGRAPH , 1976 .

[8] Peter Frankl,et al. Improved bounds for Erdős' Matching Conjecture , 2013, J. Comb. Theory, Ser. A.