Zobrazeno 1 - 10
of 306
pro vyhledávání: '"Kohayakawa, Yoshiharu"'
Autor:
Alvarado, José D., Kohayakawa, Yoshiharu, Lang, Richard, Mota, Guilherme O., Stagni, Henrique
We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with its dense
Externí odkaz:
http://arxiv.org/abs/2309.14197
The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for a given graph $H$, if $n$ is sufficiently large then any colouring of the edges of $K_n$ gives rise to copies of $H$ that exhibit certain colour patterns, namely monochrom
Externí odkaz:
http://arxiv.org/abs/2304.01846
Autor:
Barros, Gabriel Ferreira, Cavalar, Bruno Pasqualotto, Kohayakawa, Yoshiharu, Mota, Guilherme Oliveira, Naia, Tássio
We investigate the threshold $p_{\vec H}=p_{\vec H}(n)$ for the Ramsey-type property $G(n,p)\to \vec H$, where $G(n,p)$ is the binomial random graph and $G\to\vec H$ indicates that every orientation of the graph $G$ contains the oriented graph $\vec
Externí odkaz:
http://arxiv.org/abs/2211.07033
Given graphs $G$, $H_1$, and $H_2$, let $G\xrightarrow{\text{mr}}(H_1,H_2)$ denote the property that in every edge colouring of $G$ there is a monochromatic copy of $H_1$ or a rainbow copy of $H_2$. The constrained Ramsey number, defined as the minim
Externí odkaz:
http://arxiv.org/abs/2207.05201
The $\!{}\bmod k$ chromatic index of a graph $G$ is the minimum number of colors needed to color the edges of $G$ in a way that the subgraph spanned by the edges of each color has all degrees congruent to $1\!\!\pmod k$. Recently, the authors proved
Externí odkaz:
http://arxiv.org/abs/2207.04254
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23, no. 3, Discrete Algorithms (September 14, 2021) dmtcs:8325
In the $d$-dimensional hypercube bin packing problem, a given list of $d$-dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SIAM J. Comput. 35 (2005)] showed that the asymptotic performance ratio
Externí odkaz:
http://arxiv.org/abs/2107.14161
If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We determine the thr
Externí odkaz:
http://arxiv.org/abs/2012.08632
We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a $k$-graph $H$ with minimum vertex degree $\Omega(n^{k-1})$ to ensure an $F$-factor with high probability, for any $F$ that belongs to a certa
Externí odkaz:
http://arxiv.org/abs/2008.01031