Toward characterizing locally common graphs

2024-03-18 15:00 — 16:00 FAMNIT-MP1 Matjaž Krnc (University of Primorska, Slovenia) Toward characterizing locally common graphs A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by…






