The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size

DOI10.1016/j.disc.2023.113342MaRDI QIDQ2685343

Sophie Spirkl, Yanjia Li

Publication date: 21 February 2023

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

Full work available at URL: https://arxiv.org/abs/2111.10393

zbMATH Keywords

hypergraph; matching number; linear hypergraph; coloring algorithm; induced subhypergraph

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)