activity
20102026
most citedCliques in dense inhomogeneous random graphs

10 citations · 23 across the 6 of their papers we have counts for

collaborators

7 papers

math.MG2026

Continuous Kakeya type problems with special points that sweep much more area than the rest

Benjamin Joseph, Tamás Keleti, Márk Kökényesi +2

For any we construct a continuous motion of a line segment in the plane, such that the center point of the line segment traverses a given bounded set except for a s…

math.CO2015★ 10 cited

Cliques in dense inhomogeneous random graphs

Martin Doležal, Jan Hladký, András Máthé

The theory of dense graph limits comes with a natural sampling process which yields an inhomogeneous variant G(n,W) of the Erdos-Renyi random graph. Here we study the clique number…

math.CO2012★ 1 cited

Poset limits can be totally ordered

Jan Hladky, Andras Mathe, Viresh Patel +1

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense grap…

math.CA2012★ 4 cited

Sets of large dimension not containing polynomial configurations

András Máthé

The main result of this paper is the following. Given countably many multivariate polynomials with rational coefficients and maximum degree , we construct a compact set $E\subse…

math.CA2011

Reconstructing geometric objects from the measures of their intersections with test sets

Márton Elekes, Tamás Keleti, András Máthé

Let us say that an element of a given family $\A$ of subsets of can be reconstructed using test sets if there exist such that whenever $A,B\in…

math.CA2011★ 2 cited

How large dimension guarantees a given angle?

Viktor Harangi, Tamás Keleti, Gergely Kiss +4

We study the following two problems: (1) Given and $\al$, how large Hausdorff dimension can a compact set $A\su\Rn$ have if does not contain three points that form an…

math.CO2010★ 6 cited

Hamilton cycles in dense vertex-transitive graphs

Demetres Christofides, Jan Hladký, András Máthé

A famous conjecture of Lovász states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is…