A. Hansberg

activity

20122024

k

-independence number of a graph

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

collaborators

Showing math.COShow all

9 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 nu…

math.CO2021

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 $2$ -colorings of the edges of the complete graph $K_{n}$ that deal…

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.CO2019

Directed domination in oriented hypergraphs

Yair Caro, Adriana Hansberg

Erdős [On Schütte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $lo g (n + 1)$ vertices, where $lo g$ is the lo…

math.CO2018

Unavoidable chromatic patterns in 2-colorings of the complete graph

Yair Caro, Adriana Hansberg, Amanda Montejano

We consider unavoidable chromatic patterns in $2$ -colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, ext…