4 citations · 11 across the 8 of their papers we have counts for
12 papers · 1 filter
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…
Erdős-Ginzburg-Ziv type generalizations for linear equations and linear inequalities in three variables
Mario Huicochea, Amanda Montejano
For any linear inequality in three variables , we determine (if it exist) the smallest integer such that: for every mapping $χ…
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…
A rainbow version of Mantel's Theorem
Ron Aharoni, Matt DeVos, Sebastián González Hermosillo de la Maza +2
Mantel's Theorem asserts that a simple vertex graph with more than edges has a triangle (three mutually adjacent vertices). Here we consider a rainbow variant…
Unavoidable chromatic patterns in 2-colorings of the complete graph
Yair Caro, Adriana Hansberg, Amanda Montejano
We consider unavoidable chromatic patterns in -colorings of the edges of the complete graph. Several such problems are explored being a junction point between Ramsey theory, ext…
Non-monochromatic Triangles in a 2-Edge-Coloured Graph
Matt DeVos, Jessica McDonald, Amanda Montejano
Let be a simple graph and let be a partition of . We prove that whenever , there exists a subgraph of iso…