FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4362665105> ?p ?o ?g. }

• W4362665105 abstract "We solve the existence problem for <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper F> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding=application/x-tex>F</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-designs for arbitrary <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=r> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding=application/x-tex>r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-uniform hypergraphs <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper F> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding=application/x-tex>F</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. This implies that given any <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=r> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding=application/x-tex>r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-uniform hypergraph <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper F> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding=application/x-tex>F</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of any sufficiently large complete <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=r> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding=application/x-tex>r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-uniform hypergraph into edge-disjoint copies of <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper F> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding=application/x-tex>F</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, which answers a question asked e.g. by Keevash. The graph case <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=r equals 2> <mml:semantics> <mml:mrow> <mml:mi>r</mml:mi> <mml:mo>=</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> <mml:annotation encoding=application/x-tex>r=2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> was proved by Wilson in 1975 and forms one of the cornerstones of design theory. The case when <inline-formula content-type=math/mathml> <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML alttext=upper F> <mml:semantics> <mml:mi>F</mml:mi> <mml:annotation encoding=application/x-tex>F</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is complete corresponds to the existence of block designs, a problem going back to the 19th century, which was recently settled by Keevash. In particular, our argument provides a new proof of the existence of block designs, based on iterative absorption (which employs purely probabilistic and combinatorial methods). Our main result concerns decompositions of hypergraphs whose clique distribution fulfills certain regularity constraints. Our argument allows us to employ a ‘regularity boosting’ process which frequently enables us to satisfy these constraints even if the clique distribution of the original hypergraph does not satisfy them. This enables us to go significantly beyond the setting of quasirandom hypergraphs considered by Keevash. In particular, we obtain a resilience version and a decomposition result for hypergraphs of large minimum degree." @default.
• W4362665105 created "2023-04-07" @default.
• W4362665105 creator A5009459540 @default.
• W4362665105 creator A5018504861 @default.
• W4362665105 creator A5022659483 @default.
• W4362665105 creator A5051475433 @default.
• W4362665105 date "2023-04-01" @default.
• W4362665105 modified "2023-10-18" @default.
• W4362665105 title "The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹" @default.
• W4362665105 cites W130689240 @default.
• W4362665105 cites W1524753800 @default.
• W4362665105 cites W1564095107 @default.
• W4362665105 cites W1855200107 @default.
• W4362665105 cites W1923478559 @default.
• W4362665105 cites W1971289435 @default.
• W4362665105 cites W1988229094 @default.
• W4362665105 cites W2009666814 @default.
• W4362665105 cites W2010688605 @default.
• W4362665105 cites W2035593167 @default.
• W4362665105 cites W2042703645 @default.
• W4362665105 cites W2043757383 @default.
• W4362665105 cites W2044422580 @default.
• W4362665105 cites W2051071716 @default.
• W4362665105 cites W2051745720 @default.
• W4362665105 cites W2070866278 @default.
• W4362665105 cites W2081157042 @default.
• W4362665105 cites W2085160038 @default.
• W4362665105 cites W2088622619 @default.
• W4362665105 cites W2093699365 @default.
• W4362665105 cites W2099989374 @default.
• W4362665105 cites W2127175099 @default.
• W4362665105 cites W2138430007 @default.
• W4362665105 cites W2164680149 @default.
• W4362665105 cites W2183769808 @default.
• W4362665105 cites W2214401133 @default.
• W4362665105 cites W2231623396 @default.
• W4362665105 cites W2478722229 @default.
• W4362665105 cites W2592640058 @default.
• W4362665105 cites W2732711529 @default.
• W4362665105 cites W2888000324 @default.
• W4362665105 cites W2963159358 @default.
• W4362665105 cites W2963353004 @default.
• W4362665105 cites W2963746680 @default.
• W4362665105 cites W2963936522 @default.
• W4362665105 cites W3027379288 @default.
• W4362665105 cites W3037839091 @default.
• W4362665105 cites W3100797722 @default.
• W4362665105 cites W4205545339 @default.
• W4362665105 cites W4213048463 @default.
• W4362665105 cites W4230325703 @default.
• W4362665105 cites W4249334096 @default.
• W4362665105 cites W4312613502 @default.
• W4362665105 doi "https://doi.org/10.1090/memo/1406" @default.
• W4362665105 hasPublicationYear "2023" @default.
• W4362665105 type Work @default.
• W4362665105 citedByCount "1" @default.
• W4362665105 countsByYear W43626651052023 @default.
• W4362665105 crossrefType "journal-article" @default.
• W4362665105 hasAuthorship W4362665105A5009459540 @default.
• W4362665105 hasAuthorship W4362665105A5018504861 @default.
• W4362665105 hasAuthorship W4362665105A5022659483 @default.
• W4362665105 hasAuthorship W4362665105A5051475433 @default.
• W4362665105 hasConcept C11413529 @default.
• W4362665105 hasConcept C154945302 @default.
• W4362665105 hasConcept C184337299 @default.
• W4362665105 hasConcept C18903297 @default.
• W4362665105 hasConcept C199360897 @default.
• W4362665105 hasConcept C2776321320 @default.
• W4362665105 hasConcept C2777299769 @default.
• W4362665105 hasConcept C41008148 @default.
• W4362665105 hasConcept C86803240 @default.
• W4362665105 hasConceptScore W4362665105C11413529 @default.
• W4362665105 hasConceptScore W4362665105C154945302 @default.
• W4362665105 hasConceptScore W4362665105C184337299 @default.
• W4362665105 hasConceptScore W4362665105C18903297 @default.
• W4362665105 hasConceptScore W4362665105C199360897 @default.
• W4362665105 hasConceptScore W4362665105C2776321320 @default.
• W4362665105 hasConceptScore W4362665105C2777299769 @default.
• W4362665105 hasConceptScore W4362665105C41008148 @default.
• W4362665105 hasConceptScore W4362665105C86803240 @default.
• W4362665105 hasIssue "1406" @default.
• W4362665105 hasLocation W43626651051 @default.
• W4362665105 hasOpenAccess W4362665105 @default.
• W4362665105 hasPrimaryLocation W43626651051 @default.
• W4362665105 hasRelatedWork W1526789715 @default.
• W4362665105 hasRelatedWork W1529400504 @default.
• W4362665105 hasRelatedWork W155014619 @default.
• W4362665105 hasRelatedWork W1892467659 @default.
• W4362665105 hasRelatedWork W2333703843 @default.
• W4362665105 hasRelatedWork W2380389143 @default.
• W4362665105 hasRelatedWork W2394022102 @default.
• W4362665105 hasRelatedWork W2469937864 @default.
• W4362665105 hasRelatedWork W2808586768 @default.
• W4362665105 hasRelatedWork W2998403542 @default.
• W4362665105 hasVolume "284" @default.
• W4362665105 isParatext "false" @default.
• W4362665105 isRetracted "false" @default.
• W4362665105 workType "article" @default.