activity
20102021
most citedOn the pseudoachromatic index of the complete graph III

8 citations · 8 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2021

How do 9 points look like in ?

Ricardo Strausz

The aim of this note is to give an elementary proof of the following fact: given 3 red convex sets and 3 blue convex sets in , such that every red intersects every bl…

math.CO2021

On the number of heterochromatic trees in nice and beautiful colourings of complete graphs

Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Ricardo Strausz

We introduce classes of edge-colourings of the complete graph -- that we call nice and beautiful -- and study how many heterochromatic spanning trees appear under such colourings.…

math.CO2019

H-Kernels by Walks

Hortensia Galeana-Sanchez, Hugo Rincon-Galeana, Ricardo Strausz

We prove that, if every cycle of is an -cycle, then has an -kernel by walks.

math.CO2015★ 8 cited

On the pseudoachromatic index of the complete graph III

G. Araujo-Pardo, J. J. Montellano-Ballesteros, C. Rubio-Montiel +1

Let be the projective plane of order , let the pseudoachromatic number of the complete line graph of order , let $ a\in \{ 3,4,\dots,\tfrac{q}{2…

math.CO2015

On Panchromatic Patterns

Hortensia Galeana-Sanchez, Ricardo Strausz

Given D and H two digraphs, D is H-coloured iff the arcs of D are coloured with the vertices of H. After defining what do we mean by an H-walk in the coloured D, we characterise th…

math.AT2015

On The Acyclic MacPhersonian

Ricardo Strausz

The acyclic MacPhersonian $\AM_n^d$ is the poset of acyclic oriented matroids of rank on labelled elements, the combinatorial model of the space of configurations of …