activity
20112017
most citedA New Proof of Kemperman's Theorem

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

collaborators

6 papers

math.CO20171 cited

Zero-sum over and the story of

Yair Caro, Adriana Hansberg, Amanda Montejano

We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over , Graphs Combin. 32 (2016), 49--63]. For…

math.CO20154 cited

The structure of rainbow-free colorings for linear equations on three variables in Zp

Mario Huicochea, Amanda Montejano

Let p be a prime number and Zp be the cyclic group of order p. A coloring of Zp is called rainbow-free with respect to a certain equation, if it contains no rainbow solution of the…

math.CO20134 cited

A New Proof of Kemperman's Theorem

Tomas Boothby, Matt DeVos, Amanda Montejano

Let be an additive abelian group and let be finite and nonempty. The pair is called critical if the sumset $A+B = {a+b \mid $a \in Ab\in B$}$ s…

math.CO2012

Null and non--rainbow colorings of projective plane and sphere triangulations

Jorge L. Arocha, Amanda Montejano

For maximal planar graphs of order , we prove that a vertex--coloring containing no rainbow faces uses at most colors, and this is best poss…

math.CO2012

Transitive oriented 3-Hypergraphs of cyclic orders

Natalia Garcia-Colin, Amanda Montejano, Luis Montejano +1

In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allow us to give sufficie…

math.CO20112 cited

Counting patterns in colored orthogonal arrays

Amanda Montejano, Oriol Serra

Let be an orthogonal array and let be an --coloring of its ground set . We give a combinatorial identity which relates the number of vectors in with giv…