Zobrazeno 1 - 10
of 218
pro vyhledávání: '"Li, Binlong"'
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for
Externí odkaz:
http://arxiv.org/abs/2409.13491
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. Let $G$ and $H$ be two graphs. The anti-Ramsey number $\ar(G, H)$ is the maximum number of colors of an edge-coloring of $G$ that does not contain a rainbow cop
Externí odkaz:
http://arxiv.org/abs/2401.01766
Bollob\'as proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of
Externí odkaz:
http://arxiv.org/abs/2312.09999
Chung and Graham considered the problem of minimizing the number of edges in an $n$-vertex graph containing all $n$-vertex trees as a subgraph. They showed that such a graph has at least $\frac{1}{2}n \log{n}$ edges. In this note, we improve this low
Externí odkaz:
http://arxiv.org/abs/2311.01488
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\frac52(n-1)$ edges, un
Externí odkaz:
http://arxiv.org/abs/2210.03959
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Given a positive integer n and a graph G, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of K_{n} with no rainbow copy of G. Deno
Externí odkaz:
http://arxiv.org/abs/2201.03424
Autor:
Li, Binlong, Ning, Bo
Publikováno v:
Journal of Graph Theory (2023)
As the counterpart of classical theorems on cycles of consecutive lengths due to Bondy and Bollob\'as in spectral graph theory, Nikiforov proposed the following open problem in 2008: What is the maximum $C$ such that for all positive $\varepsilon
Externí odkaz:
http://arxiv.org/abs/2110.05670
We characterise the pairs of graphs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are perfect. Similarly, we characterise pairs $\{ X, Y \}$ such that all $\{ X, Y \}$-free graphs (distinct from $C_5$) are $\omega$-coloura
Externí odkaz:
http://arxiv.org/abs/2108.07071
Autor:
Zhou, Wenling, Li, Binlong
Let $\overrightarrow{P_k}$ and $\overrightarrow{C_k}$ denote the directed path and the directed cycle of order $k$, respectively. In this paper, we determine the precise maximum size of $\overrightarrow{P_k}$-free digraphs of order $n$ as well as the
Externí odkaz:
http://arxiv.org/abs/2102.10529
Publikováno v:
J. Combin. Theory Ser. B 152 (2022), 399--414
For positive integers $n>d\geq k$, let $\phi(n,d,k)$ denote the least integer $\phi$ such that every $n$-vertex graph with at least $\phi$ vertices of degree at least $d$ contains a path on $k+1$ vertices. Many years ago, Erd\H{o}s, Faudree, Schelp a
Externí odkaz:
http://arxiv.org/abs/2102.04367