Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Akhmejanova, Margarita"'
Autor:
Sokolov, Georgy, Thiessen, Maximilian, Akhmejanova, Margarita, Vitale, Fabio, Orabona, Francesco
We study the problem of learning the clusters of a given graph in the self-directed learning setup. This learning setting is a variant of online learning, where rather than an adversary determining the sequence in which nodes are presented, the learn
Externí odkaz:
http://arxiv.org/abs/2409.01428
In this work, we prove that for every $k\geq 3$ there exist arbitrarily long bicrucial $k$-power-free permutations. We also show that for every $k\geq 3$ there exist right-crucial $k$-power-free permutations of any length at least $(k-1)(2k+1)$.
Externí odkaz:
http://arxiv.org/abs/2409.01206
Asymptotic behaviour of maximum sizes of induced trees and forests has been studied extensively in last decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: 1) We prove $2$-point concentrat
Externí odkaz:
http://arxiv.org/abs/2408.15215
The celebrated Frieze's result about the independence number of $G(n,p)$ states that it is concentrated in an interval of size $o(1/p)$ for all $C_{\varepsilon}/n
Externí odkaz:
http://arxiv.org/abs/2310.09416
The paper deals with an algorithmic problem concerning combinatorial game theory. Here we introduce and analyze a continuous generalization of Chip Game from the work of Duraj, Gutowski and Kozik. The general Chip game was introduced by Aslam and Dha
Externí odkaz:
http://arxiv.org/abs/2211.09486
Publikováno v:
In Discrete Mathematics July 2024 347(7)
In this paper, we disprove EMSO(FO$^2$) convergence law for the binomial random graph $G(n,p)$ for any constant probability $p$. More specifically, we prove that there exists an existential monadic second order sentence with 2 first order variables s
Externí odkaz:
http://arxiv.org/abs/2106.13968
Autor:
Akhmejanova, Margarita, Olmezov, Konstantin, Volostnov, Aleksei, Vorobyev, Ilya, Vorob'ev, Konstantin, Yarovikov, Yury
The Wiener index $W(G)$ of a connected graph $G$ is a sum of distances between all pairs of vertices of $G$. In 1991, \v{S}olt\'{e}s formulated the problem of finding all graphs $G$ such that for every vertex $v$ the equation $W(G)=W(G-v)$ holds. The
Externí odkaz:
http://arxiv.org/abs/2012.08786
Autor:
Akhmejanova, Margarita, Balogh, József
We deal with an extremal problem concerning panchromatic colorings of hypergraphs. A vertex $r$-coloring of a hypergraph $H$ is \emph{panchromatic} if every edge meets every color. We prove that for every $3
Externí odkaz:
http://arxiv.org/abs/2008.03827
Publikováno v:
\emph{Discrete Applied Mathematics}, (2019), https://doi.org/10.1016/j.dam.2019.03.024
The paper deals with an extremal problem concerning equitable colorings of uniform hyper\-graph. Recall that a vertex coloring of a hypergraph $H$ is called proper if there are no monochro-matic edges under this coloring. A hypergraph is said to be e
Externí odkaz:
http://arxiv.org/abs/1909.00457