Decomposing uniform hypergraphs into uniform hypertrees and single edges

DOI10.1016/J.DISC.2021.112454zbMATH Open1466.05151OpenAlexW3160620128MaRDI QIDQ2032883FDOQ2032883

Authors: Zhenyu Ni, Erfang Shan, Liying Kang 

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112454

Recommendations

• Decomposing hypergraphs into simple hypertrees
• Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
• Decomposition of large combinatorial structures
• On decompositions of complete hypergraphs
• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges

zbMATH Keywords

decompositionhypergraphhypertree

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear trees in uniform hypergraphs
• Title not available (Why is that?)
• Turán number and decomposition number of intersecting odd cycles
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into 5-cycles and other small graphs
• Decomposition of graphs into cycles of length seven and single edges.
• Title not available (Why is that?)
• On complete subgraphs of different orders
• Minimum \(H\)-decompositions of graphs: edge-critical case
• The Representation of a Graph by Set Intersections
• An improved error term for minimum \(H\)-decompositions of graphs
• Decomposing hypergraphs into simple hypertrees
• Decompositions of graphs into fans and single edges
• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
• \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
• Decomposition of graphs into \((k,r)\)-fans and single edges

Cited In (6)

• \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
• Hypergraphs with polynomial representation: introducing \(r\)-splits
• Decomposition of large combinatorial structures
• Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
• A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
• Decomposing hypergraphs into simple hypertrees

This page was built for publication: Decomposing uniform hypergraphs into uniform hypertrees and single edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032883)