A tight lower bound for the hardness of clutters

DOI10.1007/s10878-017-0151-zzbMath1386.05139arXiv1807.06568OpenAlexW3105006003MaRDI QIDQ1698055

Hovhannes Sargsyan, Vahan V. Mkrtchyan

Publication date: 21 February 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

independent sethardnessmaximal independent setclutter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Combinatorial Optimization
• The hardness of the independence and matching clutter of a graph
• Unnamed Item

This page was built for publication: A tight lower bound for the hardness of clutters