Read More
Date: 9-2-2016
![]()
Date: 8-3-2022
![]()
Date: 7-4-2022
![]() |
A two-coloring of a complete graph of
nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of
where
and
are the number of red and blue triangles) is called an extremal graph. Goodman (1959) showed that for an extremal graph,
(1) |
Schwenk (1972) rewrote the equation in the form
(2) |
where is a binomial coefficient and
is the floor function.
Goodman, A. W. "On Sets of Acquaintances and Strangers at Any Party." Amer. Math. Monthly 66, 778-783, 1959.
Schwenk, A. J. "Acquaintance Party Problem." Amer. Math. Monthly 79, 1113-1117, 1972.
|
|
هل يمكن أن تكون الطماطم مفتاح الوقاية من السرطان؟
|
|
|
|
|
اكتشاف عرائس"غريبة" عمرها 2400 عام على قمة هرم بالسلفادور
|
|
|
|
|
جامعة الكفيل تقيم ندوة علمية عن الاعتماد الأكاديمي في جامعة جابر بن حيّان
|
|
|