Landau's theorem revisited again

zbMATH Open1242.05111arXiv1509.04205MaRDI QIDQ2895339FDOQ2895339

Authors: Michael Santana, K. B. Reid 

Publication date: 2 July 2012

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Abstract: We give a new proof of the sufficiency of Landau's conditions for a non-decreasing sequence of integers to be the score sequence of a tournament. The proof involves jumping down a total order on sequences satisfying Landau's conditions and provides a $O(n^2)$ algorithm that can be used to construct a tournament whose score sequence is any in the total order. We also compare this algorithm with to other algorithms that jump along this total order, one jumping down and one jumping up.

Full work available at URL: https://arxiv.org/abs/1509.04205

Recommendations

• scientific article; zbMATH DE number 1355273
• Another look at the Landau theorem
• On Landau's theorems
• Generalizations for Landau's theorem
• A generalization of a theorem of Landau
• scientific article; zbMATH DE number 3875634
• scientific article; zbMATH DE number 5060009
• A new explicit bound in Landau's theorem
• Some generalizations for a theorem by Landau

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Other combinatorial number theory (11B75)

Cited In (5)

• On linear programming duality and Landau's characterization of tournament
• Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
• Title not available (Why is that?)
• Landau's and Rado's theorems and partial tournaments
• Tournaments, oriented graphs and football sequences

This page was built for publication: Landau's theorem revisited again

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895339)