Zobrazeno 1 - 10
of 14
pro vyhledávání: '"T��th, G��za"'
Autor:
Bar��t, J��nos, T��th, G��za
A drawing of a graph is $k$-plane if every edge contains at most $k$ crossings. A $k$-plane drawing is saturated if we cannot add any edge so that the drawing remains $k$-plane. It is well-known that saturated $0$-plane drawings, that is, maximal pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7acfca2d21c56dbc79b2db108c2ad173
Autor:
Karl, J��nos, T��th, G��za
The crossing number of a graph $G$, ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing edges over all drawings of $G$. In this note we show that ${\mbox{cr}}(G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9965f44683c13ed12a68641f91a93fb
The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em $��$-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06c6f41d87bf1ba2b8c1bc2e03e61bd2
Autor:
Lehel, Jen��, T��th, G��za
For $n\leq d$, a family ${\cal F}=\{C_0,C_1,\ldots, C_n\}$ of compact convex sets in $R^d$ is called an $n$-critical family provided any $n$ members of ${\cal F}$ have a non-empty intersection, but $\bigcap_{i=0}^n C_i=\varnothing$. If $n=d$ then a l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f216ddf55a3961f946aeeb34150cdfe7
Autor:
Bar��t, J��nos, T��th, G��za
The crossing number of a graph $G$ is the minimum number of edge crossings over all drawings of $G$ in the plane. A graph $G$ is $k$-crossing-critical if its crossing number is at least $k$, but if we remove any edge of $G$, its crossing number drops
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92f2ab53a01791aafa9379f12cc195c1
We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c7fae678952bc4a7d5b12cecfe71cbf
Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to Gy. Petruska
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6d67905ccead2f61f8799c5eb7578dd
Autor:
T��th, G��za, V��rtesi, Tam��s
We show that multipartite quantum states that have a positive partial transpose with respect to all bipartitions of the particles can outperform separable states in linear interferometers. We introduce a powerful iterative method to find such states.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbbafdf0873249d61f0bf1910ec991e8
Autor:
Kov��cs, Istv��n, T��th, G��za
A planar point set of $n$ points is called {\em $��$-dense} if the ratio of the largest and smallest distances among the points is at most $��\sqrt{n}$. We construct a dense set of $n$ points in the plane with $ne^{��\left({\sqrt{\log n}}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15288d0dadc96d80d18473a4807be2b9
The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of $cr(G_0)+cr(G_1)+\ldots+
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e26b2d356964563e691cf16735c43ab