On the Maximum Number of Spanning Copies of an Orientation in a Tournament

E-ISSN： 1469-2163|26|5|775-796

ISSN： 0963-5483

Source： Combinatorics, Probability & Computing, Vol.26, Iss.5, 2017-09, pp. : 775-796

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the number of edges not covered by monochromatic copies of a fixed graph

By Keevash P. Sudakov B.

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 41-53

Elsevier

Access to resources Recommend Favorite

A FORMULA FOR THE NUMBER OF SPANNING TREES IN CIRCULANT GRAPHS WITH NONFIXED GENERATORS AND DISCRETE TORI

Bulletin of the Australian Mathematical Society, Vol. 92, Iss. 3, 2015-12 ,pp. : 365-373

Cambridge University Press

Access to resources Recommend Favorite

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

By Ackerman Eyal

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 365-375

Springer Publishing Company

Access to resources Recommend Favorite

On maximum matchings in cubic graphs with a bounded number of bridge-covering paths

Bulletin of the Australian Mathematical Society, Vol. 36, Iss. 3, 1987-12 ,pp. : 441-447

Cambridge University Press

Access to resources Recommend Favorite

Pseudo-Tournament Matrices and Their Eigenvalues

East Asian Journal on Applied Mathematics, Vol. 4, Iss. 3, 2014-08 ,pp. : 205-221

Cambridge University Press

Access to resources Recommend Favorite