9 citations · 30 across the 18 of their papers we have counts for
24 papers
The balanced upper chromatic number of linear hypergraphs and the -cube over elements
Gabriela Araujo-Pardo, Silvia Fernández-Merchant, Adriana Hansberg +3
A coloring of the vertices of a hypergraph is called \emph{balanced} if the sizes of the color classes differ by at most one. We say that a hyperedge is \emph{rainbow} if its eleme…
The evolution of unavoidable bi-chromatic patterns and extremal cases of balanceability
Yair Caro, Adriana Hansberg, Amanda Montejano
We study the color patterns that, for sufficiently large, are unavoidable in -colorings of the edges of a complete graph with respect to , where $…
Sidon-Ramsey and -Ramsey numbers
Manuel A. Espinosa-García, Amanda Montejano, Edgardo Roldán-Pensado +1
For a given positive integer , the Sidon-Ramsey number $\SR(k)$ is defined as the minimum value of such that, in every partition of the set into parts, there ex…
Erdős-Ginzburg-Ziv type generalizations for linear equations and linear inequalities in three variables
Mario Huicochea, Amanda Montejano
For any linear inequality in three variables , we determine (if it exist) the smallest integer such that: for every mapping $χ…
Recursive constructions of amoebas
Adriana Hansberg, Amanda Montejano, Yair Caro
Global amoebas are a wide and rich family of graphs that emerged from the study of certain Ramsey-Turán problems in -colorings of the edges of the complete graph that deal…
Graphs isomorphisms under edge-replacements and the family of amoebas
Yair Caro, Adriana Hansberg, Amanda Montejano
This paper offers a systematic study of a family of graphs called amoebas. Amoebas recently emerged from the study of forced patterns in -colorings of the edges of the complete…