Zobrazeno 1 - 7
of 7
pro vyhledávání: '"05C20, 05C55"'
Let $D$ be a digraph. Its acyclic number $\vec{\alpha}(D)$ is the maximum order of an acyclic induced subdigraph and its dichromatic number $\vec{\chi}(D)$ is the least integer $k$ such that $V(D)$ can be partitioned into $k$ subsets inducing acyclic
Externí odkaz:
http://arxiv.org/abs/2403.02298
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
We investigate the Ramsey numbers $r(I_m, L_n)$ which is the minimal natural number $k$ such that every oriented graph on $k$ vertices contains either an independent set of size $m$ or a transitive tournament on $n$ vertices. Apart from the finitary
Externí odkaz:
http://arxiv.org/abs/1707.09556
Publikováno v:
J. Graph Theory. 94:2 (2020) 175--191
For every $n\in\mathbb N$ we construct a finite graph $G$ such that every orientation $\vec G$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate the smallest possible cardinality of $G$. On the other hand, we prove
Externí odkaz:
http://arxiv.org/abs/1606.01973
Autor:
Loh, Po-Shen, Sudakov, Benny
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge coloring of the complete graph on n vertices, with any number of colors, has a monochromatic subgraph isomorphic to S or a rainbow (all edges differen
Externí odkaz:
http://arxiv.org/abs/0706.2107
For every $n\in\mathbb N$ we construct a finite graph $G$ such that every orientation $\vec G$ of $G$ contains an isometric copy of any oriented tree on $n$ vertices, and evaluate the smallest possible cardinality of $G$. On the other hand, we prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7059ef874a01815fa6ce89686602a7ef
Autor:
Po-Shen Loh, Benny Sudakov
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge coloring of the complete graph on n vertices, with any number of colors, has a monochromatic subgraph isomorphic to S or a rainbow (all edges differen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82bde03b627dda3ae282e064f248db88