Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A Problem on Tournaments

From MaRDI portal
Publication:5338630
Jump to:navigation, search

DOI10.4153/CMB-1964-032-2zbMath0129.34701OpenAlexW2081633786WikidataQ105487911 ScholiaQ105487911MaRDI QIDQ5338630

L. Moser, Paul Erdős

Publication date: 1964

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1964-032-2

zbMATH Keywords

operations research


Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)


Related Items

On 1-subdivisions of transitive tournaments, Kolmogorov complexity arguments in combinatorics, Large unavoidable subtournaments, On a problem of Erdős and Moser, Angle orders and zeros, Ramsey numbers for tournaments, Some asymptotic formulas for lattice paths, Unnamed Item, Minimal antichains in well-founded quasi-orders with an application to tournaments, Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5338630&oldid=20030760"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 9 February 2024, at 00:29.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki