Login / Signup

Elementary proof of a counting formula for acyclic bipartite tournaments.

Cecil C. Rousseau
Published in: J. Graph Theory (1995)
Keyphrases
  • bipartite graph
  • np hard
  • real valued
  • theorem proving
  • np complete
  • theorem prover
  • data sets
  • graph model
  • linear logic
  • database schemes
  • school children
  • set theory