SASylwia Antoniuk

Sylwia Antoniuk

*This is an algorithmically generated author record based on publicly available information.

Sylwia Antoniuk has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On constructing small subgraphs in the budget-constrained random graph process

    by Sylwia Antoniuk, Alberto Espuny Díaz, Kalina Petrova, Miloš Stojaković

    Consider the budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli, where each time an edge is offered through the (standard) random graph process we must irrevocably decide whether to "purchase" this edge or not, with our goal being to construct a graph which satisfies some property within a given time $t$ and while purchasing at most $b$ edges. We consider the problem of constructing graphs containing certain fixed small subgraphs. We provide an optimal strategy for building a graph which contains a copy of $K_4$, showing that budget $b=ω(\max\{n^8/t^5,n^2/t\})$ suffices and that if $b=o(\max\{n^8/t^5,n^2/t\})$ then no strategy can a.a.s. produce a graph containing a copy of $K_4$. This resolves a problem raised by Iľkovič, León and Shu. More generally, we obtain analogously tight results for containing a wheel of any fixed size, or a graph consisting of a tree plus one additional universal vertex. We also tackle the problem of constructing graphs containing a copy of $K_5$, obtaining both lower and upper bounds on the optimal budget, though a gap remains in this case.

  • Open Access

    Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs

    by Sylwia Antoniuk, Andrzej Dudek, Andrzej Ruciński

    We study the question of the least number of random edges that need to be added to a Pósa-Seymour graph, that is, a graph with minimum degree exceeding $\frac k{k+1}n$, to secure the existence of the $m$-th power of a Hamiltonian cycle, $m>k$. It turns out that, depending on $k$ and $m$, this quantity may be captured by two types of thresholds, with one of them, called over-threshold, becoming dominant for large $m$. Indeed, for each $k\ge2$ and $m>m_0(k)$, we establish asymptotically tight lower and upper bounds on the over-thresholds (provided they exist) and show that for infinitely many instances of $m$ the two bounds coincide. In addition, we also determine the thresholds for some small values of $k$ and $m$.

  • Open Access

    Sets and partitions minimising small differences

    by Sylwia Antoniuk, Christian Reiher

    For a bounded measurable set $A\subseteq \mathbb{R}$ we denote the Lebesgue measure of $\{(x, y)\in A^2\colon x\le y\le x+1\}$ by $Φ(A)$. We prove that if $I=A_1\cup\dots\cup A_{k+1}$ partitions an interval $I$ of length $L$ into $k+1$ measurable pieces, then $\sum_{i=1}^{k+1} Φ(A_i)\ge (\sqrt{k^2+1}-k)L-1$, where the multiplicative constant $\sqrt{k^2+1}-k$ is optimal. As a matter of fact we obtain the more general result that $Φ(A)\ge (ξ+\sqrt{1-2ξ+2ξ^2}-1)L-1$ whenever $A\subseteq I$ has measure $ξL$.

  • Open Access

    Powers of Hamiltonian cycles in randomly augmented Dirac graphs -- the complete collection

    by Sylwia Antoniuk, Andrzej Dudek, Andrzej Ruciński

    We study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, $n$-vertex graphs $G$ with minimum degree at least $(1/2+\varepsilon)n$ to which some random edges are added. For any Dirac graph and every integer $m\ge2$, we accurately estimate the threshold probability $p=p(n)$ for the event that the random augmentation $G\cup G(n,p)$ contains the $m$-th power of a Hamiltonian cycle.

  • Open Access

    High powers of Hamiltonian cycles in randomly augmented graphs

    by Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Ruciński, Mathias Schacht

    We investigate the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. For all integers $k\geq1$, $r\geq 0$, and $\ell\geq (r+1)r$, and for any $\alpha>\frac{k}{k+1}$ we show that adding $O(n^{2-2/\ell})$ random edges to an $n$-vertex graph $G$ with minimum degree at least $\alpha n$ yields, with probability close to one, the existence of the $(k\ell+r)$-th power of a Hamiltonian cycle. In particular, for $r=1$ and $\ell=2$ this implies that adding $O(n)$ random edges to such a graph $G$ already ensures the $(2k+1)$-st power of a Hamiltonian cycle (proved independently by Nenadov and Truji\'c). In this instance and for several other choices of $k$, $\ell$, and $r$ we can show that our result is asymptotically optimal.

  • Open Access

    Properly colored Hamilton cycles in Dirac-type hypergraphs

    by Sylwia Antoniuk, Nina Kamčev, Andrzej Ruciński

    We consider a robust variant of Dirac-type problems in $k$-uniform hypergraphs. For instance, we prove that if $H$ is a $k$-uniform hypergraph with minimum codegree at least $(1/2 + \gamma )n$, $\gamma >0$, and $n$ is sufficiently large, then any edge coloring $\phi$ satisfying appropriate local constraints yields a properly colored tight Hamilton cycle in $H$. Similar results for loose cycles are also shown.

  • Open Access

    A sharp threshold for collapse of the random triangular group

    by Sylwia Antoniuk, Ehud Friedgut, Tomasz Łuczak

    The random triangular group $\Gamma(n,p)$ is the group given by a random group presentation with $n$ generators in which every relator of length three is present independently with probability $p$. We show that in the evolution of $\Gamma(n,p)$ the property of collapsing to the trivial group admits a very sharp threshold.

  • Open Access

    On the connectivity Waiter-Client game

    by Sylwia Antoniuk, Codruut Grosu, Lothar Narins

    In this short note we consider a variation of the connectivity Waiter-Client game $WC(n,q,\mathcal{A})$ played on an $n$-vertex graph $G$ which consists of $q+1$ disjoint spanning trees. In this game in each round Waiter offers Client $q+1$ edges of $G$ which have not yet been offered. Client chooses one edge and the remaining $q$ edges are discarded. The aim of Waiter is to force Client to build a connected graph. If this happens Waiter wins. Otherwise Client is the winner. We consider the case where $2 < q+1 < \lfloor \frac{n-1}{2}\rfloor$ and show that for each such $q$ there exists a graph $G$ for which Client has a winning strategy. This result stands in opposition to the case where $G$ consists of just 2 spanning trees or where $G$ is a complete graph, since it has been shown that for such graphs Waiter can always force Client to build a connected graph.

  • Random Triangular Groups

    by Sylwia Antoniuk, Tomasz Łuczak, Jacek Świa̧tKowski


  • Open Access

    Random triangular groups at density

    by Sylwia Antoniuk, Tomasz Łuczak, Jacek Świa̧tKowski

    Let ${\rm\Gamma}(n,p)$ denote the binomial model of a random triangular group. We show that there exist constants $c,C>0$ such that if $p\leqslant c/n^{2}$ , then asymptotically almost surely (a.a.s.) ${\rm\Gamma}(n,p)$ is free, and if $p\geqslant C\log n/n^{2}$ , then a.a.s. ${\rm\Gamma}(n,p)$ has Kazhdan’s property (T). Furthermore, we show that there exist constants $C^{\prime },c^{\prime }>0$ such that if $C^{\prime }/n^{2}\leqslant p\leqslant c^{\prime }\log n/n^{2}$ , then a.a.s. ${\rm\Gamma}(n,p)$ is neither free nor has Kazhdan’s property (T).