Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
type: Item
instance of: scholarly article
title: Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
zbMATH Open document ID: 1464.05162
author: Zhenhua Lyu
published in: Journal of Combinatorial Optimization
publication date: 2021-05-11T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 7347229
zbMATH Keywords: Turán problem
zbMATH Keywords: digraph
zbMATH Keywords: walk
zbMATH Keywords: tournament
MaRDI profile type: Publication
full work available at URL: s10878-021-00718-0
OpenAlex ID: W3133592979
cites work: Q4871771
cites work: Extremal problems for directed graphs
cites work: Algorithmic Solution of Extremal Digraph Problems
cites work: Q5610936
cites work: Q4410007
cites work: The Theory of Round Robin Tournaments
cites work: 0–1 matrices whose k-th powers have bounded entries
cites work: Extremal digraphs avoiding an orientation of \(C_4\)
cites work: A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
cites work: Digraphs that have at most one walk of a given length with the same endpoints
cites work: Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
cites work: Extremal digraphs avoiding distinct walks of length 4 with the same endpoints
cites work: A generalization of Turan's theorem to directed graphs
cites work: Über ein Problem von K. Zarankiewicz
cites work: Subdivisions of transitive tournaments
cites work: Q5548826
cites work: Sidon sets and graphs without 4-cycles
cites work: Q5781249
cites work: On the theory of graphs
cites work: Q4869540
cites work: On the 0-1 matrices whose squares are 0-1 matrices
cites work: Matrix theory
DOI: 10.1007/S10878-021-00718-0
description: scientific article; zbMATH DE number 7347229