The partition of a uniform hypergraph into pairs of dependent hyperedges
From MaRDI portal
Publication:1356565
Recommendations
- On partitioning of hypergraphs
- On judicious partitions of uniform hypergraphs
- Judicious partitions of uniform hypergraphs
- Partitioning dense uniform hypergraphs
- Decomposition of a hypergraph by partial-edge separators
- Partitions of hypergraphs under variable degeneracy constraints
- Distinguishing partitions and asymmetric uniform hypergraphs
- Partitioning the edge set of a hypergraph into almost regular cycles
- Judicious partitions of hypergraphs
- Bounds for pairs in partitions of graphs
Cites work
- 1-Factors and Antifactor Sets
- scientific article; zbMATH DE number 3465360 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 1161248 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- Matching theory
Cited in
(5)- Ear-slicing for matchings in hypergraphs
- On some partitions of hypergraphs and cumulants having applications in statistical mechanics
- scientific article; zbMATH DE number 3950580 (Why is no real title available?)
- Fair representation by independent sets
- Partitions of hypergraphs under variable degeneracy constraints
This page was built for publication: The partition of a uniform hypergraph into pairs of dependent hyperedges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356565)