2 papers
math.CO2019
Locally common graphs
Endre Csóka, Tamás Hubai, László Lovász
Goodman proved that the sum of the number of triangles in a graph on nodes and its complement is at least ; in other words, this sum is minimized, asymptotically, by a…
math.CO2019
More non-bipartite forcing pairs
Tamas Hubai, Dan Kral, Olaf Parczyk +1
We study pairs of graphs (H_1,H_2) such that every graph with the densities of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is quasirandom; such pairs (H_1,H…