Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Hei, Doudou"'
For a fixed graph $F$, a graph $G$ is said to be $F$-saturated if $G$ does not contain a subgraph isomorphic to $F$ but does contain $F$ after the addition of any new edge. Let $M_k$ be a matching consisting of $k$ edges and $S_{n,k}$ be the join gra
Externí odkaz:
http://arxiv.org/abs/2211.03133
Autor:
Hei, Doudou, Hou, Xinmin
Given an $(r+1)$-chromatic graph $F$ and a graph $H$ that does not contain $F$ as a subgraph, we say that $H$ is strictly $F$-Tur\'an-good if the Tur\'an graph $T_{r}(n)$ is the unique graph containing the maximum number of copies of $H$ among all $F
Externí odkaz:
http://arxiv.org/abs/2208.05386
For graphs $H$ and $F$ with chromatic number $\chi(F)=k$, we call $H$ strictly $F$-Tur\'an-good (or $(H, F)$ strictly Tur\'an-good) if the Tur\'an graph $T_{k-1}(n)$ is the unique $F$-free graph on $n$ vertices containing the largest number of copies
Externí odkaz:
http://arxiv.org/abs/2112.14895
Given a family of graphs $\mathcal{F}$, a graph $G$ is said to be $\mathcal{F}$-saturated if $G$ does not contain a copy of $F$ as a subgraph for any $F\in\mathcal{F}$ but the addition of any edge $e\notin E(G)$ creates at least one copy of some $F\i
Externí odkaz:
http://arxiv.org/abs/2002.09882
Publikováno v:
In European Journal of Combinatorics May 2023 110
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Mathematics November 2021 344(11)
Autor:
Hei, Doudou, Hou, Xinmin
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society; Jan2024, Vol. 47 Issue 1, p1-14, 14p