9 citations · 10 across the 2 of their papers we have counts for
2 papers
math.CO2015★ 1 cited
Landau's Theorem Revisited Again
K. B. Reid, M. Santana
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…
math.CO2004★ 9 cited
Quadrangularity and Strong Quadrangularity in Tournaments
J. Richard Lundgren, K. B. Reid, Simone Severini +1
The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M. If…