scientific article; zbMATH DE number 1500656

MaRDI QIDQ4501678zbMATH OpenFDO

Authors L. Sunil Chandran

Publication date 7 November 2000

zbMATH Keywords

combinatorial rectanglesdeterministic algorithmexpandershigh girth graphshitting set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05)

Recommendations

• A lower bound for the hitting set size for combinatorial rectangles and an application
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• A randomized construction of high girth regular graphs
• On a construction of graphs with high chromatic capacity and large girth
• On the structure of extremal graphs of high girth
• Explicit construction of graphs with an arbitrary large girth and of large size
• A note on maximum independent sets in rectangle intersection graphs
• scientific article; zbMATH DE number 2058910
• On regular hypergraphs of high girth
• Hitting Set for hypergraphs of low VC-dimension

Cited in

(6)

• A lower bound for the hitting set size for combinatorial rectangles and an application
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension
• Finding hidden independent sets in interval graphs
• A High Girth Graph Construction
• Hitting Set for hypergraphs of low VC-dimension
• Efficient constructions of hitting sets for systems of linear functions

This page was built for publication:

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