Extremal oriented graphs avoiding 1-subdivision of an in-star
Z Huang, C Yang - arXiv preprint arXiv:2405.12025, 2024 - arxiv.org
An oriented graph is a digraph obtained from an undirected graph by choosing an
orientation for each edge. Given a positive integer $ n $ and an oriented graph $ F $, the …
orientation for each edge. Given a positive integer $ n $ and an oriented graph $ F $, the …
Extremal digraphs containing at most paths of length 2 with the same endpoints
Z Huang, Z Lyu - arXiv preprint arXiv:2406.16101, 2024 - arxiv.org
Given a positive integer $ t $, let $ P_ {t, 2} $ be the digraph consisting of $ t $ directed paths
of length 2 with the same initial and terminal vertices. In this paper, we study the maximum …
of length 2 with the same initial and terminal vertices. In this paper, we study the maximum …
[PDF][PDF] Rainbow directed cycles in the complete biorientation of Kn
JJ Montellano-Ballesteros - researchgate.net
The anti-Ramsey number was introduced in 1978 by Erdös, Simonovits and Sós [3]. For a
given graph G and a positive integer n, the anti-Ramsey number ar (n, G) is the smallest …
given graph G and a positive integer n, the anti-Ramsey number ar (n, G) is the smallest …