A. Hansberg

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

The balanced upper chromatic number of linear hypergraphs and the $n$ -cube over $t$ 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…

math.CO2024

Graphs with constant links and induced TurÃ¡n numbers

Yair Caro, Adriana Hansberg, Zsolt Tuza

A graph $G$ of constant link $L$ is a graph in which the neighborhood of any vertex induces a graph isomorphic to $L$ . Given two different graphs, $H$ and $G$ , the induced TurÃ¡n n…

math.CO2024

Unavoidable patterns in $2$ -colorings of the complete bipartite graph

Adriana Hansberg, Denae Ventura

We determine the colored patterns that appear in any $2$ -edge coloring of $K_{n, n}$ , with $n$ large enough and with sufficient edges in each color. We prove the existence of a posi…

The balanced upper chromatic number of linear hypergraphs and the n-cube over t elements

Graphs with constant links and induced TurÃ¡n numbers

Unavoidable patterns in 2-colorings of the complete bipartite graph

The balanced upper chromatic number of linear hypergraphs and the $n$ -cube over $t$ elements

Unavoidable patterns in $2$ -colorings of the complete bipartite graph