K. E. Mellinger

most citedEmbedding cycles in finite planes

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2013

Graphs Embedded into Finite Projective Planes

Keith Mellinger, Ryan Vaughn, Oscar Vega

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite gr…

math.CO2013★ 1 cited

Embedding cycles in finite planes

Felix Lazebnik, Keith E. Mellinger, Oscar Vega

We define and study embeddings of cycles in finite affine and projective planes. We show that for all $k$ , $3 \leq k \leq q^{2}$ , a $k$ -cycle can be embedded in any affine plane of order…

math.CO2010

The de Bruijn-Erdos Theorem for Hypergraphs

Noga Alon, Keith E. Mellinger, Dhruv Mubayi +1

Fix integers $n \geq r \geq 2$ . A clique partition of $(r [ n ])$ is a collection of proper subsets $A_{1}, A_{2}, \dots, A_{t} \subset [n]$ such that $⋃_{i} (r A _{i})$ is…

math.CO2010

The de Bruijn-Erdos Theorem for hypergraphs

Keith Mellinger, Dhruv Mubayi, Jacques Verstraete

Fix integers $n \geq r \geq 2$ . A clique partition of $(r [ n ])$ is a collection of proper subsets $A_{1}, A_{2}, ..., A_{t} \subset [n]$ such that $⋃_{i} (r A _{i})$ is a p…