Minimally connected r-uniform hypergraphs

MaRDI QIDQ5080901zbMATH OpenFDO

Authors Mark Budden, Josh Hiller, Andrew Penland

Publication date 31 May 2022

Full work available at URL http://ajc.maths.uq.edu.au/pdf/82/ajc_v82_p001.pdf

zbMATH Keywords

chromatic numbershyperedge colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 6500579
• The connectivity of hypergraphs
• scientific article; zbMATH DE number 3857159
• Connectivity of the linear uniform hypergraph process
• Connectivity in hypergraphs

Cites work

• scientific article; zbMATH DE number 4070935 (Why is no real title available?)
• scientific article; zbMATH DE number 6990921 (Why is no real title available?)
• An augmenting path algorithm for linear matroid parity
• Corrigendum to: ``Trees and \(n\)-good hypergraphs
• Directed hypergraphs and applications
• Edge colorings of complete graphs without tricolored triangles
• Matroid matching and some applications
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Rainbow connection for some families of hypergraphs
• Rainbow connection in graphs
• Spanning trees of 3-uniform hypergraphs
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

Cited in

(6)

• Sierpiński products of \(r\)-uniform hypergraphs
• The minimum number of vertices in uniform hypergraphs with given domination number
• scientific article; zbMATH DE number 6500579 (Why is no real title available?)
• Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
• Maximally connected \(p\)-partite uniform hypergraphs
• Minimum shadows in uniform hypergraphs and a generalization of the Takagi function

This page was built for publication: Minimally connected \(r\)-uniform hypergraphs

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