Author profile: Boza Prieto, Luis
Institutional data
Name | Boza Prieto, Luis |
Department | Matemática Aplicada I |
Knowledge area | Matemática Aplicada |
Professional category | Profesor Titular de Universidad |
Request | |
![]() ![]() ![]() ![]() |
Statistics
-
No. publications
30
-
No. visits
2482
-
No. downloads
2236
Publications |
---|
Article
![]() Exact values and lower bounds on the n-color weak Schur numbers for n = 2, 3
(Springer, 2023)
For integers k, n with k, n ≥ 1, the n-color weak Schur number WSk (n) is defined as the least integer N, such that for ... |
Article
![]() Lower bounds and exact values of the 2-color off-diagonal generalized weak Schur numbers WS(2;k,k) (Brief Announcement)
(Elsevier, 2023)
In this study, we focus on the concept of the 2-color off-diagonal generalized weak Schur numbers, denoted as WS(2; k1, ... |
Article
![]() 3-color Schur numbers
(Elsevier, 2019)
Let k ≥ 3 be an integer, the Schur number Sk(3) is the least positive integer, such that for every 3-coloring of the integer ... |
Article
![]() Numerical semigroups of Szemerédi type
(Elsevier, 2019)
Given any length k ≥ 3 and density 0 < δ ≤ 1, we introduce and study the set Sz(k, δ) consisting of all positive integers ... |
Article
![]() On the n-Color Weak Rado Numbers for the Equation x1 + x2 + ··· + xk + c = xk +1
(Taylor and Francis, 2019)
For integers k, n, c with k, n ≥ 1, and c ≥ 0, the n-color weak Rado number WRk (n, c) is defined as the least integer N, ... |
Article
![]() Equation-regular sets and the Fox–Kleitman conjecture
(Elsevier, 2018)
Given k ≥ 1, the Fox–Kleitman conjecture from 2006 states that there exists a nonzero integer b such that the 2k-variable ... |
Article
![]() On the degree of regularity of a certain quadratic Diophantine equation
(Elsevier, 2018)
We show that, for every positive integer r, there exists an integer b = b(r) such that the 4-variable quadratic Diophantine equation (x1 − y1)(x2 − y2) = b is r-regular. Our proof uses Szemerédi’s theorem on arithmetic progressions. |
Article
![]() A general lower bound on the weak Schur number
(Elsevier, 2018)
For integers k, n with k, n ≥ 1, the n-color weak Schur number W Sk(n) is defined as the least integer N, such that for ... |
Article
![]() On the finiteness of some n-color Rado numbers
(Elsevier, 2017)
For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N if any, or ... |
Article
![]() Exact value of 3 color weak Rado number
(Elsevier, 2016)
For integers k, n, c with k, n ≥ 1 and c ≥ 0, the n color weak Rado number W Rk(n, c) is defined as the least integer N, ... |
Article
![]() On the n-Color Weak Rado Numbers for the Equation x1 + x2 + ··· + xk + c = xk +1
(American Mathematical Society, 2016)
For integers k, n, c with k, n ≥ 1, the n-color Rado number Rk(n, c) is defined to be the least integer N, if it exists ... |
Article
![]() Directed pseudo-graphs and Lie algebras over finite fields
(Institute of Mathematics, Czech Academy of Sciences, 2014)
The main goal of this paper is to show an application of Graph Theory to classifying Lie algebras over finite fields. It ... |
Article
![]() A historical review of the classifications of Lie algebras
(Unión Matemática Argentina, 2013)
The problem of Lie algebras’ classification, in their different varieties, has been dealt with by theory researchers since ... |
Article
![]() Consequences of some outerplanarity extensions
(Rocky Mountain Mathematics Consortium, 2012)
In this expository paper we revise some extensions of Kuratowski planarity criterion, providing a link between the embeddings ... |
Article
![]() On the Ramsey numbers for stars versus complete graphs
(Elsevier, 2010)
For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we give ... |
Article
![]() The dimension of a graph
(Elsevier, 2007)
For each graph G the dimension of G is defined as the smallest dimension in the Euclidean Space where there is an embedding ... |
PhD Thesis |
Presentation
![]() Inmersiones celulares no caracterizables por menores
(Alberto Márquez, 2002)
|
Presentation
![]() Teoremas de Kuratowski en bosques de esferas y planos proyectivos
(Alberto Márquez, 2002)
|
PhD Thesis
![]() Inmersiones de grafos en superficies y seudosuperficies con todos los vértices en una misma cara
(2001)
La memoria se enmarca en la "Teoría de Inmersiones de Grafos en Superficies", presentando y resolviendo varios e interesantes ... |
Article
![]() Miscellaneous properties of embeddings of line, total and middle graphs
(2001)
Chartrand et al. (J. Combin. Theory Ser. B 10 (1971) 12–41) proved that the line graph of a graph G is outerplanar if and ... |
Article |
PhD Thesis |
Article
![]() Seudosuperficies y economía
(2000)
|
PhD Thesis
![]() Inmersiones de grafos en superficies tubulares de género finito
(1999)
El matemático alemán Euler (1707-1782) resolvió en 1736 el famoso problema de los puentes de Königsberg. Dicha ciudad ... |
Article
![]() Inmersiones condicionadas de grafos en superficies y seudosuperficies
(1999)
En este traba jo se procede a recapitular resultados conocidos sobre el problema de caracterizar los grafos que admiten ... |
Article
![]() A link between menger’s theorem and infinite euler graphs
(Akadémiai Kiadó, 1997)
|
Article
![]() The center of an infinite graph
(1996)
In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the ... |
Article
![]() On infinite outerplanar graphs
(Institute of Mathematics of the Czech Academy of Sciences, 1994)
In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden subgraphs |
PhD Thesis
![]() Transversalidad en grafos numerales localmente finitos
(1993)
Los primeros problemas que plantearon y resolvieron en Teoría de Grafos, son problemas referentes a la Transversalidad de ... |