Saved in:
Bibliographic Details
Main Authors: Araujo-Pardo, Gabriela, Mendoza-Cadena, Lydia Mirabel
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2506.20003
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912449071939584
author Araujo-Pardo, Gabriela
Mendoza-Cadena, Lydia Mirabel
author_facet Araujo-Pardo, Gabriela
Mendoza-Cadena, Lydia Mirabel
contents A $[z,r;g]$-mixed cage is a mixed graph of minimum order such that each vertex has $z$ in-arcs, $z$ out-arcs, $r$ edges, and it has girth $g$, and the minimum order for $[z,r;g]$-mixed graphs is denoted by $n[z,r;g]$. In this paper, we present an infinite family of mixed graphs with girth $6$, that improves, in some cases, the families that we give in G. Araujo-Pardo and L. Mendoza-Cadena. \textit{On Mixed Cages of girth 6}, arXiv:2401.14768v2. In particular, if $q$ is an even prime power we construct a family of graphs that satisfies $n[\frac{q}{4},q;6]\leq 4q^2-4$, and if $q$ is an odd prime power, and $\frac{q-3}{2}$ is odd then our family satisfies that $n[\frac{q-1}{4},q;6]\leq 4q^2-4$, otherwise $n[\frac{q-3}{4},q;6]\leq 4q^2-4$.
format Preprint
id arxiv_https___arxiv_org_abs_2506_20003
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle New upper bounds on the order of mixed cages of girth 6
Araujo-Pardo, Gabriela
Mendoza-Cadena, Lydia Mirabel
Combinatorics
A $[z,r;g]$-mixed cage is a mixed graph of minimum order such that each vertex has $z$ in-arcs, $z$ out-arcs, $r$ edges, and it has girth $g$, and the minimum order for $[z,r;g]$-mixed graphs is denoted by $n[z,r;g]$. In this paper, we present an infinite family of mixed graphs with girth $6$, that improves, in some cases, the families that we give in G. Araujo-Pardo and L. Mendoza-Cadena. \textit{On Mixed Cages of girth 6}, arXiv:2401.14768v2. In particular, if $q$ is an even prime power we construct a family of graphs that satisfies $n[\frac{q}{4},q;6]\leq 4q^2-4$, and if $q$ is an odd prime power, and $\frac{q-3}{2}$ is odd then our family satisfies that $n[\frac{q-1}{4},q;6]\leq 4q^2-4$, otherwise $n[\frac{q-3}{4},q;6]\leq 4q^2-4$.
title New upper bounds on the order of mixed cages of girth 6
topic Combinatorics
url https://arxiv.org/abs/2506.20003