Hypercube 1-factorizations from extended Hamming codes (Q2851530): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114183693, #quickstatements; #temporary_batch_1711626644914
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Turán’s Theorem in the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbows in the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of edges in a <i>c</i><sub>4</sub>‐free subgraph of <i>q</i><sub><i>n</i></sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable factorizations of Hamming shells / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic Colorings of Subcubes of the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the size of square-free subgraphs of the hypercube / rank
 
Normal rank

Latest revision as of 23:24, 6 July 2024

scientific article
Language Label Description Also known as
English
Hypercube 1-factorizations from extended Hamming codes
scientific article

    Statements