Adriana Hansberg

activity

20122024

most citedPartitions of graphs into small and large sets

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

collaborators

3 papers

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…

math.CO2016

Zero-sum subsequences in bounded-sum ${- 1, 1}$ -sequences

Yair Caro, Adriana Hansberg, Amanda Montejano

The following result gives the flavor of this paper: Let $t$ , $k$ and $q$ be integers such that $q \geq 0$ , $0 \leq t < k$ and $t \equiv k (mod 2)$ , and let $s \in [0, t + 1]$ …

math.CO2012★ 4 cited

Partitions of graphs into small and large sets

Asen Bojilov, Yair Caro, Adriana Hansberg +1

Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V (G)$ \emph{ $k$ -small} if, for every vertex $v \in A$ , $° (v) \leq n - ∣ A ∣ + k$ . A subset $B \subseteq V(G…

Unavoidable patterns in 2-colorings of the complete bipartite graph

Zero-sum subsequences in bounded-sum {−1,1}-sequences

Partitions of graphs into small and large sets

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

Zero-sum subsequences in bounded-sum ${- 1, 1}$ -sequences