A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints.

Zejun Huang Zhenhua Lyu Pu Qiao

Published in: Discret. Math. (2019)

Keyphrases

endpoints
line segments
minimal cost
directed graph
equivalence classes
closely related
fixed length
single valued
total length
markov models
continuous functions
minimal path
minimal length