Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2503.11923 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909538399027200 |
|---|---|
| author | Diaz-Diaz, Dennis J. de-la-Fuente-Jimenez, Isaías F. Hoekstra-Mendoza, Teresa I. Licona-Velázquez, Miguel E. Terrones-Segura, Victoria |
| author_facet | Diaz-Diaz, Dennis J. de-la-Fuente-Jimenez, Isaías F. Hoekstra-Mendoza, Teresa I. Licona-Velázquez, Miguel E. Terrones-Segura, Victoria |
| contents | In this paper, we introduce the concept of bikernel by monochromatic paths of a bicolored digraph. This concept is strongly motivated by the existing notions of kernels, kernels by monochromatic paths, and double stable augmented categories. We establish sufficient and necessary conditions for several families of bicolored digraphs to have a bikernel by monochromatic paths. Also, we characterize bicolored digraphs without monochromatic cycles that possess a bikernel by monochromatic paths. Similarly, we characterize bicolored digraphs with monochromatic cycles that also have a bikernel by monochromatic paths. Furthermore, we prove sufficient and necessary conditions for some families of digraphs to be $BK$-colorable. This means that a bicoloration of the digraph exists where the resulting bicolored digraph has a bikernel. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_11923 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bikernels by monochromatic paths Diaz-Diaz, Dennis J. de-la-Fuente-Jimenez, Isaías F. Hoekstra-Mendoza, Teresa I. Licona-Velázquez, Miguel E. Terrones-Segura, Victoria Combinatorics In this paper, we introduce the concept of bikernel by monochromatic paths of a bicolored digraph. This concept is strongly motivated by the existing notions of kernels, kernels by monochromatic paths, and double stable augmented categories. We establish sufficient and necessary conditions for several families of bicolored digraphs to have a bikernel by monochromatic paths. Also, we characterize bicolored digraphs without monochromatic cycles that possess a bikernel by monochromatic paths. Similarly, we characterize bicolored digraphs with monochromatic cycles that also have a bikernel by monochromatic paths. Furthermore, we prove sufficient and necessary conditions for some families of digraphs to be $BK$-colorable. This means that a bicoloration of the digraph exists where the resulting bicolored digraph has a bikernel. |
| title | Bikernels by monochromatic paths |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.11923 |