Transversal coalitions in hypergraphs

DOI10.1016/J.DISC.2024.114267MaRDI QIDQ6646394zbMATH OpenFDO

Authors Michael A. Henning, A. Yeo

Publication date 2 December 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114267

zbMATH Keywords

edge coloringshypergraphLatin squareslinear intersecting hypergraphtransversal

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Transversal (matching) theory (05D15)

Recommendations

• Upper transversals in hypergraphs
• Transversal numbers of uniform hypergraphs
• On the transversal number of k-uniform connected hypergraphs
• Hypergraphs with large transversal number
• scientific article; zbMATH DE number 5440

Cites work

• A characterization of graphs with given total coalition numbers
• A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
• An average degree condition for independent transversals
• Domination in Graphs: Core Concepts
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 7666858 (Why is no real title available?)
• Independent coalition in graphs: existence and characterization
• Introduction to coalitions in graphs
• Linear hypergraphs with large transversal number and maximum degree two
• Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
• On the coalition number of trees
• Singleton coalition graph chains
• Small transversals in hypergraphs
• Structures of domination in graphs
• The number of transversals in a Latin square
• The Tuza–Vestergaard Theorem
• Thresholds for the monochromatic clique transversal game
• Topics in Domination in Graphs
• Total domination in graphs
• Total domination of graphs and small transversals of hypergraphs
• Transversals and domination in uniform hypergraphs
• Transversals and independence in linear hypergraphs with maximum degree two
• Transversals in hypergraphs through a new combinatorial game
• Transversals in linear uniform hypergraphs
• Transversals in regular uniform hypergraphs
• Upper bounds on the coalition number
• Upper transversals in hypergraphs

Cited in

(2)

• General sharp upper bounds on the transversal coalition number
• Total k-coalition: bounds, exact values and an application to double coalition

This page was built for publication: Transversal coalitions in hypergraphs

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