On Min–Max Pair in Tournaments
Sign Up to like & getrecommendations! Published in 2018 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-018-1899-3
Abstract: Let T be a tournament of order $$n\ge 3$$n≥3. A pair of distinct vertices x, y of T is called a min–max pair if one of x and y is of minimum out-degree, while the other… read more here.
Keywords: pair tournaments; min max; pair; max pair ... See more keywords