activity
20122019
most citedMatching measure, Benjamini-Schramm convergence and the monomer-dimer free energy

14 citations · 24 across the 6 of their papers we have counts for

collaborators

8 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

Almost-monochromatic sets and the chromatic number of the plane

Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi

In a colouring of a pair with and with is \emph{almost monochromatic} if is monochromatic but …

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…

math.CO2016★ 2 cited

Densities of 3-vertex graphs

Roman Glebov, Andrzej Grzesik, Ping Hu +3

Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadru…

math.CO2015★ 6 cited

Chromatic roots and limits of dense graphs

Peter Csikvari, Peter E. Frenkel, Jan Hladky +1

In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the…

math-ph2014★ 14 cited

Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy

Miklós Abért, Péter Csikvári, Tamás Hubai

We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of…

math.CO2012

Positive graphs

Omar Antolín Camarena, Endre Csóka, Tamás Hubai +2

We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graph…

math.CO2012★ 2 cited

Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs

Miklós Abért, Tamás Hubai

We define the chromatic measure of a finite simple graph as the uniform distribution on its chromatic roots. We show that for a Benjamini-Schramm convergent sequence of finite grap…