A. Hansberg

activity

20122026

most citedThe evolution of unavoidable bi-chromatic patterns and extremal cases of balanceability

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

collaborators

Showing 2020 · math.COShow all

4 papers · 2 filters

math.CO2020

The balancing number and list balancing number of some graph classes

Antoine Dailly, Adriana Hansberg, Laura Eslava +1

Given a graph $G$ , a 2-coloring of the edges of $K_{n}$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If…

math.CO2020

On zero-sum spanning trees and zero-sum connectivity

Yair Caro, Adriana Hansberg, Josef Lauri +1

We consider $2$ -colourings $f : E (G) \to {- 1, 1}$ of the edges of a graph $G$ with colours $- 1$ and $1$ in $Z$ . A subgraph $H$ of $G$ is said to be a zero-sum…

math.CO2020

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 $2$ -colorings of the edges of the complete…

math.CO2020

On the balanceability of some graph classes

Antoine Dailly, Adriana Hansberg, Denae Ventura

Given a graph $G$ , a 2-coloring of the edges of $K_{n}$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges are in each color class. If…