The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1090/memo/1406 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4362665105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly perfect matchings in regular simple hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypergraph matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self‐dual embeddings of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimalist designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional clique decompositions of dense graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-decompositions of graphs with high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique decompositions of multipartite graphs and completion of Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional triangle decompositions of dense 3-partite graphs / 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: Q4873725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Triangle Decompositions in Graphs with Large Minimum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Existence of Resolvable Graph Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Construction of Almost Steiner Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euler tours in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decomposition threshold of a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint Hamilton cycles in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Factors in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic existence of regular combinatorial structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all Steiner triple systems have perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic existence of large sets of designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Clique Decompositions of Dense Partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on independent sets in steiner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Inversion of Certain Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-trivial \(t\)-designs without repeated blocks exist for all \(t\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help / rank
 
Normal rank
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms / 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
Property / cites work
 
Property / cites work: An existence theory for pairwise balanced designs. III: Proof of the existence conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing hypergraphs into simple hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and computational aspects of graph packing and graph decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on Dirac-type problems for hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1090/MEMO/1406 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:48, 30 December 2024

scientific article; zbMATH DE number 7679304
Language Label Description Also known as
English
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
scientific article; zbMATH DE number 7679304

    Statements

    The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2023
    0 references
    block designs
    0 references
    decomposition
    0 references
    iterative absorption
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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