Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Natalia García-Colín"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 2, p 351 (2023)
Externí odkaz:
https://doaj.org/article/f289842d47514d778fc9cb552d441026
Publikováno v:
Discussiones Mathematicae Graph Theory.
Publikováno v:
Discrete & Computational Geometry. 58:746-754
The tolerant Tverberg theorem generalizes Tverberg’s theorem by introducing a new parameter t called tolerance. It states that there is a minimal number N so that any set of at least N points in $$\mathbb R^d$$ can be partitioned into r disjoint se
Let $G$ be a cubic graph and $\Pi$ be a polyhedral embedding of this graph. The extended graph, $G^{e},$ of $\Pi$ is the graph whose set of vertices is $V(G^{e})=V(G)$ and whose set of edges $E(G^{e})$ is equal to $E(G) \cup \mathcal{S}$, where $\mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ac232d64a319fdd1e67488f8127b115
Publikováno v:
Discrete Applied Mathematics. 210:164-170
The natural extension of the concept of perfection in graphs to hypergraphs is to define a uniform m -hypergraph, H , as perfect, if it satisfies that for every subhypergraph H ' , ź ( H ' ) = ź ω ( H ' ) m - 1 ź , where ź ( H ' ) and ω ( H ' )
Autor:
Natalia García-Colín, David G. Larman
Publikováno v:
Graphs and Combinatorics. 31:1403-1422
Let $$2\le k\le \left\lfloor {\frac{d}{2}}\right\rfloor $$2≤k≤d2 and let $$\nu {(d, k)}$$?(d,k) be the largest number such that any set of $$\nu {(d,k)}$$?(d,k) points lying in general position in $$\mathbb {R}^d$$Rd can be mapped by a permissibl
Publikováno v:
Electronic Notes in Discrete Mathematics. 44:155-161
In this paper we study the family of oriented transitive 3-hypergraphs that arise from cyclic permutations and intervals in the circle, in order to search for the notion of perfection on hypergraphs.
Publikováno v:
Order. 30:869-875
In this paper we introduce the definition of transitivity for oriented 3-hypergraphs in order to study partial and complete cyclic orders. This definition allows us to give sufficient conditions on a partial cyclic order to be totally extendable. Fur
The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e230e61bee8bb216c13eb1e3cfa979ad
Autor:
Dolores Lara, Thomas Hackl, Oswin Aichholzer, Gabriela Araujo-Pardo, Natalia García-Colín, Christian Rubio-Montiel, Jorge Urrutia
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. If for each vertex its incident edges have different color, then this max
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef2d037ffd455ae71523bf761ddf40c6
http://arxiv.org/abs/1303.4673
http://arxiv.org/abs/1303.4673