8 citations · 9 across the 5 of their papers we have counts for
5 papers
Triangle-free subsets of the -distance graph of the hypercube
Padmini Mukkamala, Ananthakrishnan Ravi
Given the -distance graph on the hypercube $\F_2^n$, where two vertices are adjacent if their Hamming distance is exactly , we study the maximum size of a triangle-f…
Obstacles, Slopes, and Tic-Tac-Toe: An excursion in discrete geometry and combinatorial game theory
V S Padmini Mukkamala
A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of are represented by distinct points in the plane and every edge is represented by a straight-…
Drawing cubic graphs with the four basic slopes
Padmini Mukkamala, Dömötör Pálvölgyi
We show that every cubic graph can be drawn in the plane with straight-line edges using only the four basic slopes . We also prove that four slopes have this pr…
Lower bounds on the obstacle number of graphs
Padmini Mukkamala, János Pach, Dömötör Pálvölgyi
Given a graph , an {\em obstacle representation} of is a set of points in the plane representing the vertices of , together with a set of connected obstacles such that tw…
Almost optimal pairing strategy for Tic-Tac-Toe with numerous directions
Padmini Mukkamala, Dömötör Pálvölgyi
We show that there is an , such that, in the Maker-Breaker game played on where Maker needs to put at least of his marks consecutively in one of given win…