Tur\'an problems for digraphs avoiding distinct walks of a given length with the same endpoints
Combinatorics
2016-08-23 v1
Abstract
Let and be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number when .
Cite
@article{arxiv.1608.06170,
title = {Tur\'an problems for digraphs avoiding distinct walks of a given length with the same endpoints},
author = {Zejun Huang and Zhenhua Lyu and Pu Qiao},
journal= {arXiv preprint arXiv:1608.06170},
year = {2016}
}