Superpure digraph designs (Q3150160): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On indecomposable pure Mendelsohn triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal decomposition and packing of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 2-designs Slambda(2,3,v) without repeated blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal double covers of k<sub>n</sub> and a conjecture of chung and west / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic results on suborthogonal \(\overrightarrow{\mathfrak G}\)-decompositions of complete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions, handcuffed prisoners and balanced p-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suborthogonal double covers of the complete graph by stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-designs and related designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures / rank
 
Normal rank

Latest revision as of 17:35, 4 June 2024

scientific article
Language Label Description Also known as
English
Superpure digraph designs
scientific article

    Statements

    Superpure digraph designs (English)
    0 references
    0 references
    0 references
    29 September 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    Mendelsohn designs
    0 references
    decomposition
    0 references
    asymptotic existence
    0 references
    supersimple designs
    0 references
    0 references