Differential Methods for Finding Independent Sets in Hypergraphs

DOI10.1137/S0895480104442571MaRDI QIDQ5470819zbMATH OpenOpenAlexFDO

Authors Yusheng Li, Wenan Zang

Publication date 1 June 2006

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480104442571

zbMATH Keywords

algorithmconvex function

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Independence in 5-uniform hypergraphs
• Improved lower bounds on k‐independence
• On independent sets in hypergraphs
• Independent Sets in Bounded-Degree Hypergraphs
• Independent sets in bounded-degree hypergraphs

Cited in

(5)

• Independence in uniform linear triangle-free hypergraphs
• An algorithm for finding the independence number of a recursively generated hypergraph
• On vertex independence number of uniform hypergraphs
• scientific article; zbMATH DE number 3893238 (Why is no real title available?)
• Independence in 5-uniform hypergraphs

This page was built for publication: Differential Methods for Finding Independent Sets in Hypergraphs

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