On balanced biregular cages
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913105939791872 |
|---|---|
| author | Gabriela, Araujo-Pardo György, Kiss |
| author_facet | Gabriela, Araujo-Pardo György, Kiss |
| contents | In this paper, we introduce a problem closely related to the {\emph{Cage Problem}}. We are interested in {\emph{Balanced Biregular Cages}}, which are the smallest biregular graphs of fixed girth that have the same number of vertices of one degree as the other. We introduce the graphs and obtain lower and upper bounds for some values of degree and girth. In particular, we construct relatively small balanced biregular graphs from incidence graphs of finite projective, affine, and biaffine planes and we show that some of the obtained graphs are balanced biregular cages. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_22395 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On balanced biregular cages Gabriela, Araujo-Pardo György, Kiss Combinatorics 05C35, 51E15 In this paper, we introduce a problem closely related to the {\emph{Cage Problem}}. We are interested in {\emph{Balanced Biregular Cages}}, which are the smallest biregular graphs of fixed girth that have the same number of vertices of one degree as the other. We introduce the graphs and obtain lower and upper bounds for some values of degree and girth. In particular, we construct relatively small balanced biregular graphs from incidence graphs of finite projective, affine, and biaffine planes and we show that some of the obtained graphs are balanced biregular cages. |
| title | On balanced biregular cages |
| topic | Combinatorics 05C35, 51E15 |
| url | https://arxiv.org/abs/2604.22395 |