Old Web
English
Sign In
Acemap
>
Paper
>
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring.
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring.
2021
Naoki Matsumoto
Masaki Yamamoto
Masahito Yamazaki
Keywords:
Mathematics
Monochromatic color
Combinatorics
Edge (geometry)
Correction
Source
Cite
Save
Machine Reading By IdeaReader
2
References
0
Citations
NaN
KQI
[]