2 papers
cs.GT2008
Disproving the Neighborhood Conjecture
Heidi Gebauer
We study the following Maker/Breaker game. Maker and Breaker take turns in choosing vertices from a given n-uniform hypergraph F, with Maker going first. Maker's goal is to complet…
cs.DM2008
Unsatisfiable (k,(4*2^k/k))-CNF formulas
Heidi Gebauer
A boolean formula in a conjuctive normal form is called a (k,s)-formula if every clause contains exactly k variables and every variable occurs in at most s clauses. We prove the ex…