Zobrazeno 1 - 10
of 165
pro vyhledávání: '"Lee, Jae-baek"'
A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation is quasirandom if and only if the pattern density of each of the twen
Externí odkaz:
http://arxiv.org/abs/2407.06869
The \emph{Ramsey multiplicity constant} of a graph $H$ is the limit as $n$ tends to infinity of the minimum density of monochromatic labeled copies of $H$ in a $2$-edge colouring of $K_n$. Fox and Wigderson recently identified a large family of graph
Externí odkaz:
http://arxiv.org/abs/2309.06959
Autor:
Lee, Jae-baek, Noel, Jonathan A.
A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$-colouring of the edges of a large complete graph is asymptotically minimized by a random colouring. It is well known that the disjoint union of two common
Externí odkaz:
http://arxiv.org/abs/2303.09296
Publikováno v:
European Journal of Combinatorics 2024
In the problem ${\rm Mix}(H)$ one is given a graph $G$ and must decide if the Hom-graph ${\rm {\bf Hom}}(G,H)$ is connected. We show that if $H$ is a triangle-free reflexive graph with at least one cycle, ${\rm Mix}(H)$ is ${\rm coNP}$-complete. The
Externí odkaz:
http://arxiv.org/abs/2207.03632
Publikováno v:
J Algebr Comb, 57, (2022) pp. 53--73
For a graph $H$, the $H$-recolouring problem $\operatorname{Recol}(H)$ asks, for two given homomorphisms from a given graph $G$ to $H$, if one can get between them by a sequence of homomorphisms of $G$ to $H$ in which consecutive homomorphisms differ
Externí odkaz:
http://arxiv.org/abs/2111.00723
Autor:
Jeon, Dong-Hwan, Park, Si-Nae, Lee, Jae-Baek, Kim, Young-Ill, Yang, Kee-Jeong, Kang, Jin-Kyu, Kim, Dae-Hwan, Sung, Shi-Joon, Hwang, Dae-Kue
Publikováno v:
In Journal of Science: Advanced Materials and Devices March 2024 9(1)
Publikováno v:
In European Journal of Combinatorics February 2024 116
Publikováno v:
European J. Combin. 86 (2020) 103086
Given a loop-free graph $H$, the reconfiguration problem for homomorphisms to $H$ (also called $H$-colourings) asks: given two $H$-colourings $f$ of $g$ of a graph $G$, is it possible to transform $f$ into $g$ by a sequence of single-vertex colour ch
Externí odkaz:
http://arxiv.org/abs/1810.01111
Publikováno v:
In Journal of Emergency Medicine January 2023 64(1):70-73
For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two $H$-colourings $\varphi$ and $\psi$ of $G$, does there exist a sequence $f_0,\dots,f_m$ of $H$-colourings such that $f_0
Externí odkaz:
http://arxiv.org/abs/1712.00200