Decomposition of large combinatorial structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3974987 (Why is no real title available?)
- scientific article; zbMATH DE number 3989375 (Why is no real title available?)
- scientific article; zbMATH DE number 4008408 (Why is no real title available?)
- scientific article; zbMATH DE number 3545699 (Why is no real title available?)
- A note on the decomposition of graphs into isomorphic matchings
- Decomposition of large uniform hypergraphs
- Intersection Theorems for Systems of Sets
- NP-completeness of graph decomposition problems
- The decomposition of trees into subtrees
Cited in
(16)- Decompositions of partially ordered sets into chains and antichains of given size
- Tiling edge-ordered graphs with monotone paths and other structures
- Decomposing uniform hypergraphs into uniform hypertrees and single edges
- Combinatorial and computational aspects of graph packing and graph decomposition
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Rational decomposition of dense hypergraphs and some related eigenvalue estimates
- scientific article; zbMATH DE number 4073028 (Why is no real title available?)
- On large sets ofPk-decompositions
- Decomposition of large uniform hypergraphs
- Mappings on Decomposable Combinatorial Structures: Analytic Approach
- A note on some embedding problems for oriented graphs
- Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
- scientific article; zbMATH DE number 5763331 (Why is no real title available?)
- scientific article; zbMATH DE number 3950580 (Why is no real title available?)
- Order statistics for decomposable combinatorial structures
- Transitive tournament tilings in oriented graphs with large minimum total degree
This page was built for publication: Decomposition of large combinatorial structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107544)