Semi-Strong Colouring of Intersecting Hypergraphs
暂无分享,去创建一个
[1] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[2] L. Lovász. Combinatorial problems and exercises , 1979 .
[3] Ehud Friedgut,et al. On the measure of intersecting families, uniqueness and stability , 2008, Comb..
[4] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[5] B. Reed. Graph Colouring and the Probabilistic Method , 2001 .
[6] Yuichi Yoshida,et al. Partially Symmetric Functions Are Efficiently Isomorphism Testable , 2015, SIAM J. Comput..
[7] Ping Ngai Chung. On the c-strong chromatic number of t-intersecting hypergraphs , 2013, Discret. Math..
[8] Noga Alon,et al. Paul Erdős and Probabilistic Reasoning , 2013 .
[9] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[10] Tommy R. Jensen,et al. Graph Coloring Problems: Jensen/Graph , 1994 .