A triangular book graph consists of
triangles sharing
one common graph edge. Equivalently, it is the graph
join
of a complete graph on two vertices
and an empty graph on
vertices. It has
vertices and
edges. This is the book graph
of the Ramsey number literature, distinct from the
book graph
formed from squares (Rousseau and Sheehan
1978).
For these triangular books, is the least
such that every red-blue edge
coloring of
contains a red
or a blue
. Chung and Wesley (2026) proved
|
(1)
|
whenever
or
is the order of a conference graph. In particular,
either number may be a prime power congruent to 1
modulo 4. They also proved the equality when
for a prime power
with
, and when
for a prime power
with
. Chung and Wesley (2026) report that an AI
system assisted in discovering several of these constructions.
The off-diagonal asymptotics are now known for every fixed . Dai et al. (2026) completed
the determination of
|
(2)
|
as , where
is the ceiling function
and
|
(3)
|
with
and
in the middle range. Their new bounds resolve the interval
. Dai et al. (2026) report
that ChatGPT assisted with the arguments and computational exploration for their
blocked-configuration approach.
Hu (2026) proved that for some absolute constant , every sufficiently large
-vertex simple graph with no
subgraph, for
, contains at most
copies of the cycle graph
, where
and
. Equality holds precisely
for balanced blow-ups of
.