Embedding Factorizations for 3-Uniform Hypergraphs (Q4920661): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: M. Amin Bahmanian / rank
Normal rank
 
Property / author
 
Property / author: M. Amin Bahmanian / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1532260067 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114236179 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.05949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Lindner's conjecture on embeddings of partial Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theorem for latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of connected \(k\)-factorizations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete regular s-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of factorizations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of almost regular edge-colourings of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding edge‐colorings into 2‐edge‐connected <i>k</i>‐factorizations of <i>k<sub>kn+1</sub></i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Theorem with an Application to Latin Rectangles / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:24, 6 July 2024

scientific article; zbMATH DE number 6164632
Language Label Description Also known as
English
Embedding Factorizations for 3-Uniform Hypergraphs
scientific article; zbMATH DE number 6164632

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references