Hypertree shrinking avoiding low degree vertices

DOI10.37236/12991MaRDI QIDQ6841448zbMATH OpenFDO

Authors Karolína Hylasová, Tomáš Kaiser

Publication date 20 March 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12991

zbMATH Keywords

shrinking operationhypergraph orientation lemma

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Hypergraphs (05C65)

Cites work

• scientific article; zbMATH DE number 3512137 (Why is no real title available?)
• A constructive proof of the general Lovász local lemma
• A generalization of Kónig's theorem
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Degrees in oriented hypergraphs and Ramsey p-chromatic number
• Edge-partitioning 3-edge-connected graphs into paths
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On the orientation of graphs and hypergraphs

This page was built for publication: Hypertree shrinking avoiding low degree vertices

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