Rainbow triangles and the Caccetta‐Häggkvist conjecture
暂无分享,去创建一个
[1] E. A. Nordhaus,et al. Triangles in an Ordinary Graph , 1963, Canadian Journal of Mathematics.
[2] Gábor N. Sárközy,et al. Gallai colorings of non-complete graphs , 2010, Discret. Math..
[3] Alexander A. Razborov. On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs , 2013, J. Graph Theory.
[4] Christian Reiher,et al. The clique density theorem , 2012, 1212.2454.
[5] Gábor Simonyi,et al. Edge colorings of complete graphs without tricolored triangles , 2004, J. Graph Theory.
[6] Alexander A. Razborov,et al. On the Minimal Density of Triangles in Graphs , 2008, Combinatorics, Probability and Computing.
[7] Danna Zhou,et al. d. , 1934, Microbial pathogenesis.
[8] Jan Hladký,et al. Counting flags in triangle-free digraphs , 2009, Electron. Notes Discret. Math..
[9] John Adrian Bondy,et al. Counting subgraphs a new approach to the Caccetta-Häggkvist conjecture , 1997, Discret. Math..
[10] Jian Shen,et al. On the girth of digraphs , 2000, Discret. Math..
[11] A. Goodman. On Sets of Acquaintances and Strangers at any Party , 1959 .
[12] Alexandr V. Kostochka,et al. On Directed Triangles in Digraphs , 2007, Electron. J. Comb..
[13] M. Simonovits,et al. On the number of complete subgraphs of a graph II , 1983 .
[14] Guanghui Wang,et al. Color degree and heterochromatic cycles in edge-colored graphs , 2012, Eur. J. Comb..
[15] Shenggui Zhang,et al. Rainbow triangles in edge-colored graphs , 2014, Eur. J. Comb..
[16] Hao Li,et al. Rainbow C3's and c4's in edge-colored graphs , 2013, Discret. Math..
[17] T. Gallai. Transitiv orientierbare Graphen , 1967 .
[18] Vladimir Nikiforov,et al. The number of cliques in graphs of given order and size , 2007, 0710.2305.