论文信息 - О существовании полноцветных раскрасок для равномерных гиперграфов@@@The existence of panchromatic colourings for uniform hypergraphs - 字舞流文

О существовании полноцветных раскрасок для равномерных гиперграфов@@@The existence of panchromatic colourings for uniform hypergraphs

Дмитрий Александрович Шабанов | Dmitrii Aleksandrovich Shabanov | D. Shabanov

[1] P. Erdos. On a combinatorial problem. II , 1964 .

[2] Alexandr V. Kostochka,et al. On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs , 2002, Electron. J. Comb..

[3] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.

[4] Alexandr V. Kostochka,et al. Color-Critical Graphs and Hypergraphs with Few Edges: A Survey , 2006 .

[5] Noga Alon,et al. Choice Numbers of Graphs: a Probabilistic Approach , 1992, Combinatorics, Probability and Computing.

[6] Дмитрий Александрович Шабанов,et al. Экстремальные задачи для раскрасок равномерных гиперграфов@@@Extremal problems for colourings of uniform hypergraphs , 2007 .

[7] Alexandr V. Kostochka,et al. Density Conditions for Panchromatic Colourings of Hypergraphs , 2001, Comb..

[8] D. Shabanov,et al. Extremal problems for colourings of uniform hypergraphs , 2007 .