Read More
Date: 21-4-2022
1511
Date: 18-5-2022
1030
Date: 17-4-2022
1277
|
An extremal graph in which the forced triangles are all the same color. Call the number of red monochromatic forced triangles and the number of blue monochromatic forced triangles, then a blue-empty graph is an extremal graph with . For even , a blue-empty graph can be achieved by coloring red two complete subgraphs of points (the red net method). There is no blue-empty coloring for odd except for (Lorden 1962).
Lorden, G. "Blue-Empty Chromatic Graphs." Amer. Math. Monthly 69, 114-120, 1962.
Sauvé, L. "On Chromatic Graphs." Amer. Math. Monthly 68, 107-111, 1961.
|
|
دراسة تحدد أفضل 4 وجبات صحية.. وأخطرها
|
|
|
|
|
جامعة الكفيل تحتفي بذكرى ولادة الإمام محمد الجواد (عليه السلام)
|
|
|