Constructing regular self-complementary uniform hypergraphs (Q2896012): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2124701750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All block designs with \(b={v\choose k}/2\) exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on halving the complete designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining \(t\)-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Basis for Trades / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending t-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / 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: Q3784080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root cases of large sets of \(t\)-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 2-subset-regular self-complementary 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-transitive self-complementary uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On regular and strongly-regular self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally trivial t-designs and t-designs without repeated blocks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:48, 5 July 2024

scientific article
Language Label Description Also known as
English
Constructing regular self-complementary uniform hypergraphs
scientific article

    Statements

    Constructing regular self-complementary uniform hypergraphs (English)
    0 references
    0 references
    0 references
    13 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    self-complementary hypergraph
    0 references
    regular hypergraph
    0 references
    complementing permutation
    0 references
    large set of \(t\)-designs
    0 references
    0 references