Author profile: Cera López, Martín
Institutional data
Name | Cera López, Martín |
Department | Matemática Aplicada I |
Knowledge area | Matemática Aplicada |
Professional category | Catedrático de Escuela Universitaria |
Request | |
Statistics
-
No. publications
16
-
No. visits
2013
-
No. downloads
2847
Publications |
---|
Article
A network approach to analyze neuronal lineage and layer innervation in the Drosophila optic lobes
(Public Library of Science, 2020)
The optic lobes of the fruit fly Drosophila melanogaster form a highly wired neural network composed of roughly 130.000 ... |
Article
An advance in infinite graph models for the analysis of transportation networks
(De Gruyter, 2016)
This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number ... |
Article
Superconnectivity of Networks Modeled by the Strong Product of Graphs
(University of Belgrade, 2015)
Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using ... |
Chapter of Book
Theoretical progress on infinite graphs and their average degree: applicability to the European Road Transport Network
(IEEE Computer Society, 2015)
There are many problems in Graph Theory for finite graphs relating the number of vertices and the number of edges and, ... |
Chapter of Book
Aplicaciones de la teoría de grafos en la neurogénesis
(Universidad de Almería, 2015)
El l´obulo ´optico de la Drosophila (mosca de la fruta) es una estructura altamente sofisticada con m´as de 60.000 neuronas ... |
Chapter of Book
Theoretical progress on infinite graphs and their average degree: applicability to the European Road Transport Network
(IEEE Computer Society, 2015)
There are many problems in Graph Theory for finite graphs relating the number of vertices and the number of edges and, ... |
Article
Topological minors in bipartite graphs
(Springer, 2011)
For a bipartite graph G on m and n vertices, respectively, in its vertices classes, and for integers s and t such that 2 ... |
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
Locating a Central Hunter on the Plane
(Springer, 2007)
Protection, surveillance or other types of coverage services of mobile points call for different, asymmetric distance ... |
PhD Thesis
Grafos contractibles a un grafo completo
(2006)
Los objetivos de esta tesis se pueden enmarcar dentro de la Teoría Extremal de Grafos. Uno de los problemas más conocidos ... |
Article
Extremal Graphs without Topological Complete Subgraphs
(2004)
The exact values of the function $ex(n;TK_{p})$ are known for ${\lceil \frac{2n+5}{3}\rceil}\leq p < n$ (see [Cera, Diánez, ... |
PhD Thesis
Problemas extremales en teoría de grafos
(2003)
Uno de los problemas más representativos dentro de la Teoría Extremal de Grafos consiste en el estudio de los valores de ... |
Presentation
El problema de Turán sobre grafos bipartitos completos
(Alberto Márquez, 2002)
|
Presentation
Máximas aristas de un grafo sin subgrafos menores completos
(Alberto Márquez, 2002)
|
Article
The Size of a Graph Without Topological Complete Subgraphs
(2000)
In this note we show a new upperbound for the function ex(n;TKp), i.e., the maximum number of edges of a graph of order n ... |
PhD Thesis
El tamaño de un grafo sin subgrafos homeomorfos a un grafo completo
(1998)
"Desde el origen de la Teoría de Grafos Extremales, uno de los problemas más generales que pueden plantearse en este campo, ... |