10 citations · 10 across the 1 of their papers we have counts for
6 papers
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…
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…
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…
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…
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…
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…