Premium
Elementary proof of a counting formula for acyclic bipartite tournaments
Author(s) -
Rousseau C. C.
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200307
Subject(s) - bipartite graph , mathematics , combinatorics , elementary proof , discrete mathematics , graph
This note gives a simple proof of a formula due to Bollobás, Frank and Karoński for counting acyclic bipartit tournaments. © 1995 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom