BLBernardo Llano
Bernardo Llano
*This is an algorithmically generated author record based on publicly available information.
Bernardo Llano has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Bernardo M. Abrego
California State University, Northridge
2 shared publications - Hortensia Galeana-Sánchez
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Área de la investigación científica, Circuito Exterior, Ciudad Universitaria, Coyoacán, CDMX, México
2 shared publications - Juan José Montellano-Ballesteros
Instituto de Matemáticas UNAM Ciudad Universitaria 04510 México, D. F
2 shared publications - Mika Olsen
Departmento de Matemáticas Aplicadas y Sistemas Universidad Autónoma Metropolitana -Cuajimalpa México City México
2 shared publications - Silvia Fernández-Merchant
California State University, Northridge
2 shared publications - Alewyn P. Burger
University of Stellenbosch
1 shared publication
Latest Publications
- Open AccessBounds on the cardinality of restricted sumsets in $\mathbb{Z}_{p}$In this paper we present a procedure which allows to transform a subset $A$ of $\mathbb{Z}_{p}$ into a set $ A'$ such that $ |2\hspace{0.15cm}\widehat{} A'|\leq|2\hspace{0.15cm}\widehat{} A | $, where $2\hspace{0.15cm}\widehat{} A$ is defined to be the set $\left\{a+b:a\neq b,\;a,b\in A\right\}$. From this result, we get some lower bounds for $ |2\hspace{0.15cm}\widehat{} A| $. Finally, we give some remarks related to the problem for which sets $A\subset \mathbb{Z}_{p}$ we have the equality $|2\hspace{0.15cm}\widehat{} A|=2|A|-1$.Open AccessBounds on the cardinality of restricted sumsets in $\mathbb{Z}_{p}$In this paper we present a procedure which allows to transform a subset $A$ of $\mathbb{Z}_{p}$ into a set $ A'$ such that $ |2\hspace{0.15cm}\widehat{} A'|\leq|2\hspace{0.15cm}\widehat{} A | $, where $2\hspace{0.15cm}\widehat{} A$ is defined to be the set $\left\{a+b:a\neq b,\;a,b\in A\right\}$. From this result, we get some lower bounds for $ |2\hspace{0.15cm}\widehat{} A| $. Finally, we give some remarks related to the problem for which sets $A\subset \mathbb{Z}_{p}$ we have the equality $|2\hspace{0.15cm}\widehat{} A|=2|A|-1$.
- Open Access
- 5 October 2017
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 24 (4) , P4.5
Disproof of a Conjecture of Neumann-Lara
We disprove the following conjecture due to Víctor Neumann-Lara: for every pair $(r,s)$ of integers such that $r\geq s\geq 2$, there is an infinite set of circulant tournaments $T$ such that the dichromatic number and the cyclic triangle free disconnection of $T$ are equal to $r$ and $s$, respectively. Let $\mathcal{F}_{r,s}$ denote the set of circulant tournaments $T$ with $dc(T)=r$ and $\overrightarrow{\omega }_{3}\left( T\right) =s$. We show that for every integer $s\geq 4$ there exists a lower bound $b(s)$ for the dichromatic number $r$ such that $\mathcal{F}_{r,s}=\emptyset $ for every $r<b(s)$. We construct an infinite set of circulant tournaments $T$ such that $dc(T)=b(s)$ and $\overrightarrow{\omega }_{3}(T)=s$ and give an upper bound $B(s)$ for the dichromatic number $r$ such that for every $r\geq B(s)$ there exists an infinite set $\mathcal{F}_{r,s}$ of circulant tournaments. Some infinite sets $\mathcal{F}_{r,s}$ of circulant tournaments are given for $b(s)<r<B(s)$.- 5 October 2017
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 24 (4) , P4.5
Open AccessDisproof of a Conjecture of Neumann-Lara
We disprove the following conjecture due to Víctor Neumann-Lara: for every pair $(r,s)$ of integers such that $r\geq s\geq 2$, there is an infinite set of circulant tournaments $T$ such that the dichromatic number and the cyclic triangle free disconnection of $T$ are equal to $r$ and $s$, respectively. Let $\mathcal{F}_{r,s}$ denote the set of circulant tournaments $T$ with $dc(T)=r$ and $\overrightarrow{\omega }_{3}\left( T\right) =s$. We show that for every integer $s\geq 4$ there exists a lower bound $b(s)$ for the dichromatic number $r$ such that $\mathcal{F}_{r,s}=\emptyset $ for every $r<b(s)$. We construct an infinite set of circulant tournaments $T$ such that $dc(T)=b(s)$ and $\overrightarrow{\omega }_{3}(T)=s$ and give an upper bound $B(s)$ for the dichromatic number $r$ such that for every $r\geq B(s)$ there exists an infinite set $\mathcal{F}_{r,s}$ of circulant tournaments. Some infinite sets $\mathcal{F}_{r,s}$ of circulant tournaments are given for $b(s)<r<B(s)$. - Open Access
The number of dominating $k$-sets of paths, cycles and wheels
We give a shorter proof of the recurrence relation for the domination polynomial $\gamma (P_{n},t)$ and for the number $\gamma _{k}(P_{n})$ of dominating $k$-sets of the path with $n$ vertices. For every positive integers $n$ and $k,$ numbers $\gamma _{k}(P_{n})$ are determined solving a problem posed by S. Alikhani in CID 2015. Moreover, the numbers of dominating $k$-sets $\gamma _{k}(C_{n})$ of cycles and $\gamma _{k}(W_{n})$ of wheels with $n$ vertices are computed.Open AccessThe number of dominating $k$-sets of paths, cycles and wheels
We give a shorter proof of the recurrence relation for the domination polynomial $\gamma (P_{n},t)$ and for the number $\gamma _{k}(P_{n})$ of dominating $k$-sets of the path with $n$ vertices. For every positive integers $n$ and $k,$ numbers $\gamma _{k}(P_{n})$ are determined solving a problem posed by S. Alikhani in CID 2015. Moreover, the numbers of dominating $k$-sets $\gamma _{k}(C_{n})$ of cycles and $\gamma _{k}(W_{n})$ of wheels with $n$ vertices are computed. - 25 April 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 783-800
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- 25 April 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 783-800
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- Open Access
$k$-colored kernels in semicomplete multipartite digraphs
An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K $ of its vertices such that for every vertex $v\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and for every $% u,v\in K$ there does not exist an at most $k$-colored directed path between them. In this paper we prove that an $m$-colored semicomplete $r$-partite digraph $D$ has a $k$-colored kernel provided that $r\geq 3$ and {enumerate} [(i)] $k\geq 4,$ [(ii)] $k=3$ and every $\overrightarrow{C}_{4}$ contained in $D$ is at most 2-colored and, either every $\overrightarrow{C}_{5}$ contained in $D$ is at most 3-colored or every $\overrightarrow{C}_{3}\uparrow \overrightarrow{C}_{3}$ contained in $D$ is at most 2-colored, [(iii)] $k=2$ and every $\overrightarrow{C}_{3}$ and $\overrightarrow{C}%_{4}$ contained in $D$ is monochromatic. {enumerate} If $D$ is an $m$-colored semicomplete bipartite digraph and $k=2$ (resp. $k=3 $) and every $\overrightarrow{C}_{4}\upuparrows \overrightarrow{C}_{4}$ contained in $D$ is at most 2-colored (resp. 3-colored), then $D$ has a $% 2$-colored (resp. 3-colored) kernel. Using these and previous results, we obtain conditions for the existence of $k$-colored kernels in $m$-colored semicomplete $r$-partite digraphs for every $k\geq 2$ and $r\geq 2$.Open Access$k$-colored kernels in semicomplete multipartite digraphs
An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K $ of its vertices such that for every vertex $v\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and for every $% u,v\in K$ there does not exist an at most $k$-colored directed path between them. In this paper we prove that an $m$-colored semicomplete $r$-partite digraph $D$ has a $k$-colored kernel provided that $r\geq 3$ and {enumerate} [(i)] $k\geq 4,$ [(ii)] $k=3$ and every $\overrightarrow{C}_{4}$ contained in $D$ is at most 2-colored and, either every $\overrightarrow{C}_{5}$ contained in $D$ is at most 3-colored or every $\overrightarrow{C}_{3}\uparrow \overrightarrow{C}_{3}$ contained in $D$ is at most 2-colored, [(iii)] $k=2$ and every $\overrightarrow{C}_{3}$ and $\overrightarrow{C}%_{4}$ contained in $D$ is monochromatic. {enumerate} If $D$ is an $m$-colored semicomplete bipartite digraph and $k=2$ (resp. $k=3 $) and every $\overrightarrow{C}_{4}\upuparrows \overrightarrow{C}_{4}$ contained in $D$ is at most 2-colored (resp. 3-colored), then $D$ has a $% 2$-colored (resp. 3-colored) kernel. Using these and previous results, we obtain conditions for the existence of $k$-colored kernels in $m$-colored semicomplete $r$-partite digraphs for every $k\geq 2$ and $r\geq 2$. - Open Access
k-colored kernels
We study $k$-colored kernels in $m$-colored digraphs. An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K$ of its vertices such that (i) from every vertex $v\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and (ii) for every $u,v\in K$ there does not exist an at most $k$-colored directed path between them. In this paper, we prove that for every integer $k\geq 2$ there exists a $% (k+1)$-colored digraph $D$ without $k$-colored kernel and if every directed cycle of an $m$-colored digraph is monochromatic, then it has a $k$-colored kernel for every positive integer $k.$ We obtain the following results for some generalizations of tournaments: (i) $m$-colored quasi-transitive and 3-quasi-transitive digraphs have a $k$% -colored kernel for every $k\geq 3$ and $k\geq 4,$ respectively (we conjecture that every $m$-colored $l$-quasi-transitive digraph has a $k$% -colored kernel for every $k\geq l+1)$, and (ii) $m$-colored locally in-tournament (out-tournament, respectively) digraphs have a $k$-colored kernel provided that every arc belongs to a directed cycle and every directed cycle is at most $k$-colored.Open Accessk-colored kernels
We study $k$-colored kernels in $m$-colored digraphs. An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K$ of its vertices such that (i) from every vertex $v\notin K$ there exists an at most $k$-colored directed path from $v$ to a vertex of $K$ and (ii) for every $u,v\in K$ there does not exist an at most $k$-colored directed path between them. In this paper, we prove that for every integer $k\geq 2$ there exists a $% (k+1)$-colored digraph $D$ without $k$-colored kernel and if every directed cycle of an $m$-colored digraph is monochromatic, then it has a $k$-colored kernel for every positive integer $k.$ We obtain the following results for some generalizations of tournaments: (i) $m$-colored quasi-transitive and 3-quasi-transitive digraphs have a $k$% -colored kernel for every $k\geq 3$ and $k\geq 4,$ respectively (we conjecture that every $m$-colored $l$-quasi-transitive digraph has a $k$% -colored kernel for every $k\geq l+1)$, and (ii) $m$-colored locally in-tournament (out-tournament, respectively) digraphs have a $k$-colored kernel provided that every arc belongs to a directed cycle and every directed cycle is at most $k$-colored. - 31 May 2010
- Published by Elsevier in Applied Mathematics Letters
- Vol. 23 (5) , 630-632
An infinite family of self-diclique digraphs
- 31 May 2010
- Published by Elsevier in Applied Mathematics Letters
- Vol. 23 (5) , 630-632
An infinite family of self-diclique digraphs
- Open Access
An inequality for Kruskal-Macaulay functions
Given integers $k\geq1$ and $n\geq0$, there is a unique way of writing $n$ as $n=\binom{n_{k}}{k}+\binom{n_{k-1}}{k-1}+...+\binom{n_{1}}{1}$ so that $0\leq n_{1}<...<n_{k-1}<n_{k}$. Using this representation, the \emph{Kruskal-Macaulay function of}$n$ is defined as $\partial^{k}(n) =\binom{n_{k}-1}{k-1}+\binom{n_{k-1}-1}{k-2}+...+\binom{n_{1}-1}% {0}.$ We show that if $a\geq0$ and $a<\partial^{k+1}(n) $, then $\partial^{k}(a) +\partial^{k+1}(n-a) \geq \partial^{k+1}(n) .$ As a corollary, we obtain a short proof of Macaulay's Theorem. Other previously known results are obtained as direct consequences.Open AccessAn inequality for Kruskal-Macaulay functions
Given integers $k\geq1$ and $n\geq0$, there is a unique way of writing $n$ as $n=\binom{n_{k}}{k}+\binom{n_{k-1}}{k-1}+...+\binom{n_{1}}{1}$ so that $0\leq n_{1}<...<n_{k-1}<n_{k}$. Using this representation, the \emph{Kruskal-Macaulay function of}$n$ is defined as $\partial^{k}(n) =\binom{n_{k}-1}{k-1}+\binom{n_{k-1}-1}{k-2}+...+\binom{n_{1}-1}% {0}.$ We show that if $a\geq0$ and $a<\partial^{k+1}(n) $, then $\partial^{k}(a) +\partial^{k+1}(n-a) \geq \partial^{k+1}(n) .$ As a corollary, we obtain a short proof of Macaulay's Theorem. Other previously known results are obtained as direct consequences. - 28 December 2008
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (24) , 6056-6063
Circulant tournaments of prime order are tight
- 28 December 2008
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (24) , 6056-6063
Circulant tournaments of prime order are tight
- Open Access
- 24 September 2008
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 43 (1) , 1-20
On the Maximum Number of Translates in a Point Set
- 24 September 2008
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 43 (1) , 1-20
Open AccessOn the Maximum Number of Translates in a Point Set