A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles

L. Sunil Chandran. A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles. In C. Pandu Rangan, Venkatesh Raman, Ramaswamy Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings. Volume 1738 of Lecture Notes in Computer Science, pages 283-290, Springer, 1999. [doi]

Abstract

Abstract is missing.