The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (Q1043788): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-008-0818-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021844752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4653767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the number of tournaments with specified scores / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Round Robin Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling of labeled tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:19, 2 July 2024

scientific article
Language Label Description Also known as
English
The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
scientific article

    Statements

    The interchange graphs of tournaments with minimum score vectors are exactly hypercubes (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    0 references
    tournaments
    0 references
    score vectors
    0 references
    interchange graphs
    0 references
    hypercubes
    0 references
    0 references