On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching (Q400365): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2014.05.021 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A survey on the existence of<i>G</i>-Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic and dihedral 1-factorizations of multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-factorizations of complete graphs with vertex-regular automorphism groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frattini-based starters in 2-groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian 1-factorizations of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3594046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1‐rotational <i>k</i>‐factorizations of the complete graph and new solutions to the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-pyramidal Hamiltonian cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic one-factorization of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric 1-factorizations of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nilpotent 1-factorizations of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3781908 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2014.05.021 / rank
 
Normal rank

Latest revision as of 16:28, 9 December 2024

scientific article
Language Label Description Also known as
English
On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
scientific article

    Statements

    On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching (English)
    0 references
    21 August 2014
    0 references
    matching
    0 references
    decomposition of a graph
    0 references
    \(G\)-design
    0 references
    sharply transitive permutation group
    0 references
    0 references
    0 references

    Identifiers