A generalization of Sperner's theorem and an application to graph orientations

DOI10.1016/j.dam.2007.09.025zbMath1194.05154OpenAlexW2023563698MaRDI QIDQ1026119

Wei Xu, Konrad Engel, Jian Guo Qian

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.025

zbMATH Keywords

graph orientationaverage distanceSperner's theoremminimum average distance of orientationsmultifamily of subsets

Mathematics Subject Classification ID

Extremal set theory (05D05) Distance in graphs (05C12)

Related Items

A proof of a conjecture on maximum Wiener index of oriented ladder graphs, A generalization of the independence number, Strongly self-centered orientation of complete \(k\)-partite graphs, Solution to a problem of Katona on counting cliques of weighted graphs, Sperner's Theorem and a Problem of Erdős, Katona and Kleitman

Cites Work

• Optimal orientations of graphs and digraphs: A survey
• Minimum average distance of strong orientations of graphs
• The diameter of an orientation of a complete multipartite graph
• On the sum of all distances in a graph or digraph
• Unnamed Item
• Unnamed Item
• Unnamed Item