Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Micha A. Perles"'
Publikováno v:
Journal of Graph Theory. 94:159-169
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5421ee7dc41402aa99fe67458ba1a8a1
https://doi.org/10.1002/jgt.22512
https://doi.org/10.1002/jgt.22512
Publikováno v:
Ars mathematica contemporanea
Naj bo ?$V$? množica ?$2m \; (1 \le m < \infty)$? točk v ravnini. Dve daljici ?$I, J$? s krajiščema v ?$V$? se sekata če je relint ?$I \cap \text{relint} \, J$? singleton (tj. množica z enim samim elementom). (Popolno) križno-prirejanje ?$M$?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eade3ffbf9d1534ec1ac8776fb1bd35a
https://doi.org/10.26493/1855-3974.1228.d7d
https://doi.org/10.26493/1855-3974.1228.d7d
Autor:
Chaya Keller, Micha A. Perles
Publikováno v:
Discrete & Computational Geometry. 60:1-8
Let G be a complete convex geometric graph on 2m vertices, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that meets every element of F. In [C. Keller and M. A. Perles, On the smallest sets bloc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c76a73db8614a8f4a0e8156c4a7a097
https://doi.org/10.1007/s00454-017-9921-8
https://doi.org/10.1007/s00454-017-9921-8
Publikováno v:
Graphs and Combinatorics. 33:981-990
Let V be a finite set of points in the plane, not all on one line, and let l be a line that contains at least 2 points of V. We say that l is a k -bisector of V if there are at least k points of V on each one of the two open half-planes bounded by l.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59ad4629c5a5f0a006d3941814c30812
https://doi.org/10.1007/s00373-017-1799-y
https://doi.org/10.1007/s00373-017-1799-y
Autor:
Micha A. Perles, Moriah Sigron
Publikováno v:
Discrete & Computational Geometry. 57:56-70
Define $$M^d=\{ z(t):t \in \mathbb {R}\}$$Md={z(t):tźR}, where $$z(t)=(t,t^2,\ldots ,t^d)\in \mathbb {R}^d$$z(t)=(t,t2,ź,td)źRd. Suppose $$A=\{z(t_i):1\le i\le n\}\subset M^d$$A={z(ti):1≤i≤n}źMd, where $$t_1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1370130bf3215a40e3a9d0f41d081ecd
https://doi.org/10.1007/s00454-016-9813-3
https://doi.org/10.1007/s00454-016-9813-3
Autor:
Chaya Keller, Micha A. Perles
Publikováno v:
Graphs and Combinatorics. 32:2497-2514
A well-known result of Kupitz from 1982 asserts that the maximal number of edges in a convex geometric graph (CGG) on n vertices that does not contain $$k+1$$k+1 pairwise disjoint edges is kn (provided $$n>2k$$n>2k). For $$k=1$$k=1 and $$k=n/2-1$$k=n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebca2dd3f2a58248c893b629115c3bfc
https://doi.org/10.1007/s00373-016-1719-6
https://doi.org/10.1007/s00373-016-1719-6
Publikováno v:
Journal of Graph Theory. 84:512-520
A natural topic of algebraic graph theory is the study of vertex transitive graphs. In the present article, we investigate locally 3-transitive graphs of girth 4. Taking our former results on locally symmetric graphs of girth 4 as a starting point, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d1e7346b2786b592d454844785a8d67
https://doi.org/10.1002/jgt.22038
https://doi.org/10.1002/jgt.22038
Publikováno v:
Discrete Applied Mathematics. 161:1576-1585
We give a tight upper bound for the polygonal diameter (a.k.a. link diameter) of the interior, resp. exterior, of a simple n-gon, n>=3, in the plane as a function of n, and describe ann-gon (n>=3) for which both upper bounds (for the interior and for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f082912fcf006898ba829d219255f6b
https://doi.org/10.1016/j.dam.2013.01.018
https://doi.org/10.1016/j.dam.2013.01.018
Autor:
Noa Nitzan, Micha A. Perles
Publikováno v:
Israel Journal of Mathematics. 196:483-490
We say that a finite set of points S in a Euclidean space is Radon stable if for every primitive Radon partition within S, the corresponding Radon point is also in S. Stable sets in the plane can be described easily. Michael Kallay (1984) gave an ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ab67bce83ff1daee0de1210165585c1
https://doi.org/10.1007/s11856-013-0021-z
https://doi.org/10.1007/s11856-013-0021-z
Autor:
Noa Nitzan, Micha A. Perles
Publikováno v:
Discrete & Computational Geometry. 49:454-477
Suppose S is a planar set. Two points $$a,b$$ in S see each other via S if $$[a,b]$$ is included in S . F. Valentine proved in 1957 that if S is closed, and if for every three points of S, at least two see each other via S, then S is a union of three
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::831a3dd2be50b83c98c5291b04c6c593
https://doi.org/10.1007/s00454-012-9484-7
https://doi.org/10.1007/s00454-012-9484-7