12 citations · 43 across the 17 of their papers we have counts for
23 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…
Graphs with constant links and induced Turán numbers
Yair Caro, Adriana Hansberg, Zsolt Tuza
A graph of constant link is a graph in which the neighborhood of any vertex induces a graph isomorphic to . Given two different graphs, and , the induced Turán nu…
Unavoidable patterns in -colorings of the complete bipartite graph
Adriana Hansberg, Denae Ventura
We determine the colored patterns that appear in any -edge coloring of , with large enough and with sufficient edges in each color. We prove the existence of a posi…
New recursive constructions of amoebas and their balancing number
Laura Eslava, Adriana Hansberg, Tonatiuh Matos Wiederhold +1
The definition of amoeba graphs is based on iterative \emph{feasible edge-replacements}, where, at each step, an edge from the graph is removed and placed in an available spot in a…
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 $…
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…