Géza Tóth

From MaRDI portal
Person:178539

Available identifiers

zbMath Open toth.gezaWikidataQ102187736 ScholiaQ102187736MaRDI QIDQ178539

List of research outcomes

PublicationDate of PublicationType
Monochromatic spanning trees and matchings in ordered complete graphs2024-02-23Paper
Disjointness graphs of short polygonal chains2024-01-29Paper
Helly-type theorems for the ordering of the vertices of a hypergraph2023-12-19Paper
1-planar unit distance graphs2023-10-02Paper
Saturated 2-plane drawings with few edges2023-09-13Paper
Monochromatic infinite sets in Minkowski planes2023-08-17Paper
Entanglement and extreme spin squeezing of unpolarized states2023-05-12Paper
Disjointness graphs of segments in the space2023-03-30Paper
https://portal.mardi4nfdi.de/entity/Q58819182023-03-13Paper
Peeling Sequences2022-11-10Paper
Crossing lemma for the odd-crossing number2022-10-06Paper
Quantum Wasserstein distance based on an optimization over separable states2022-09-20Paper
Scaling in income inequalities and its dynamical origin2022-08-18Paper
Crossings between non-homotopic edges2022-06-10Paper
Improvement on the crossing number of crossing-critical graphs2022-03-21Paper
Wealth distribution in modern societies: collected data and a master equation approach2022-03-01Paper
Crossings Between Non-homotopic Edges2021-12-01Paper
Improvement on the Crossing Number of Crossing-Critical Graphs2021-12-01Paper
A slightly better bound on the crossing number in terms of the pair-crossing number2021-05-29Paper
On the hollow enclosed by convex sets2021-03-16Paper
Detecting metrologically useful entanglement in the vicinity of Dicke states2021-02-19Paper
Permutationally invariant state reconstruction2020-12-02Paper
A crossing lemma for multigraphs2020-08-18Paper
Petruska's question on planar convex sets2020-07-08Paper
Crossings between non-homotopic edges2020-06-26Paper
A crossing lemma for multigraphs2020-06-16Paper
Improvement on the crossing number of crossing-critical graphs2020-03-03Paper
Many touchings force many crossings2019-07-17Paper
Entanglement between two spatially separated atomic modes2019-07-03Paper
An algorithm to find maximum area polygons circumscribed about a convex polygon2019-02-20Paper
Many Touchings Force Many Crossings2019-02-20Paper
The number of crossings in multigraphs with no empty lens2018-08-30Paper
Disjointness graphs of segments2018-08-13Paper
Block partitions: an extended view2018-07-23Paper
Improvements on the density of maximal 1‐planar graphs2018-07-13Paper
Note on \(k\)-planar crossing numbers2018-02-19Paper
Monotone paths in line arrangement2017-09-29Paper
Improving the crossing lemma by finding more crossings in sparse graphs2017-09-29Paper
Point sets with many k -sets2017-09-29Paper
Separation with restricted families of sets2016-08-18Paper
Erdős-Szekeres theorem for lines2015-10-14Paper
Survey on Decomposition of Multiple Coverings2015-06-24Paper
Saturated simple and \(k\)-simple topological graphs2015-05-12Paper
Quantum metrology from a quantum information science perspective2014-11-11Paper
A note on coloring line arrangements2014-09-04Paper
https://portal.mardi4nfdi.de/entity/Q53955662014-02-17Paper
Monochromatic empty triangles in two-colored point sets2013-11-29Paper
A Better Bound for the Pair-Crossing Number2013-09-25Paper
Separating families of convex sets2013-09-03Paper
Improvement on the decay of crossing numbers2013-06-26Paper
Monotone crossing number2013-04-15Paper
https://portal.mardi4nfdi.de/entity/Q49069402013-02-28Paper
Tangled Thrackles2013-01-07Paper
Simulating continuous quantum systems by mean field fluctuations2012-11-09Paper
Erdős-Szekeres theorem for point sets with forbidden subconfigurations2012-09-19Paper
Drawing Hamiltonian cycles with no large angles2012-06-12Paper
Monotone Crossing Number2012-03-09Paper
Entanglement witnesses in spin models2011-12-04Paper
Graph unique-maximum and conflict-free colorings2011-08-23Paper
Disjoint edges in topological graphs2011-06-27Paper
QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB2010-10-25Paper
Towards the Albertson conjecture2010-06-16Paper
Graph Unique-Maximum and Conflict-Free Colorings2010-05-28Paper
Drawing Hamiltonian Cycles with No Large Angles2010-04-27Paper
Convex polygons are cover-decomposable2010-04-12Paper
Discrete and Computational Geometry2010-02-05Paper
Cubic graphs have bounded slope parameter2010-02-04Paper
https://portal.mardi4nfdi.de/entity/Q36567242010-01-13Paper
Indecomposable Coverings2009-10-15Paper
https://portal.mardi4nfdi.de/entity/Q33925562009-08-17Paper
Graph Drawing2009-08-11Paper
Degenerate crossing numbers2009-04-27Paper
Cubic Graphs Have Bounded Slope Parameter2009-03-03Paper
Towards an implementation of the 3D visibility skeleton2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015462009-02-10Paper
Decomposition of multiple coverings into many parts2008-11-19Paper
Long alternating paths in bicolored point sets2008-09-04Paper
Note on the pair-crossing number and the odd-crossing number2008-08-19Paper
Crossing Stars in Topological Graphs2008-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35145282008-07-21Paper
Drawing cubic graphs with at most five slopes2008-04-28Paper
The shortest distance among points in general position.2008-04-25Paper
Improvement on the Decay of Crossing Numbers2008-03-25Paper
Crossing Stars in Topological Graphs2008-03-18Paper
Multiple coverings of the plane with triangles2007-12-19Paper
Drawing Cubic Graphs with at Most Five Slopes2007-08-28Paper
Indecomposable Coverings2007-08-28Paper
How many ways can one draw a graph?2007-05-08Paper
https://portal.mardi4nfdi.de/entity/Q34248982007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54902762007-01-26Paper
Improving the crossing lemma by finding more crossings in sparse graphs2006-12-06Paper
Graph Drawing2006-11-13Paper
PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE2006-10-16Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54746272006-06-26Paper
https://portal.mardi4nfdi.de/entity/Q52902792006-04-28Paper
Graph Drawing2005-12-07Paper
Topological graphs with no large grids2005-11-24Paper
https://portal.mardi4nfdi.de/entity/Q56927202005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q56927222005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q46575892005-03-14Paper
Geometric graphs with no self-intersecting path of length three2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q30437222004-08-06Paper
Towards an implementation of the 3D visibility skeleton2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723222004-08-04Paper
Unavoidable configurations in complete topological graphs2004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44278852003-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44222892003-09-03Paper
Monotone paths in line arrangements2003-04-28Paper
Crossing numbers of random graphs2003-03-19Paper
Recognizing string graphs is decidable2003-03-17Paper
A modular version of the Erdős– Szekeres theorem2003-02-18Paper
Which crossing number is it anyway?2002-12-10Paper
Modeling nematohydrodynamics in liquid crystal devices2002-09-12Paper
Domain motion in confined liquid crystals2002-08-21Paper
Ramsey-type results for unions of comparability graphs2002-07-29Paper
Point sets with many \(k\)-sets2002-07-10Paper
Convex sets in the plane with three of every four meeting2002-02-13Paper
New bounds on crossing numbers2001-06-28Paper
Finding convex sets in convex positions2001-06-13Paper
An Erdős-Szekeres type problem in the plane2001-06-12Paper
Erdős-Szekeres-type theorems for segments and noncrossing convex sets2001-04-23Paper
https://portal.mardi4nfdi.de/entity/Q44846912001-03-15Paper
Note on geometric graphs2000-12-11Paper
Geometric graphs with few disjoint edges2000-06-27Paper
CNNUM stereo architecture and 3D template design techniques1999-06-20Paper
Ramsey-type results for geometric graphs. II1999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q42253081999-01-18Paper
A generalisation of the Erdős-Szekeres theorem to disjoint convex sets1998-12-15Paper
Note on the Erdős-Szekeres theorem1998-12-15Paper
Graphs drawn with few crossings per edge1998-11-24Paper
Note on an art gallery problem1998-10-01Paper
Ramsey-type results for geometric graphs. I1998-04-22Paper
https://portal.mardi4nfdi.de/entity/Q43523311998-03-02Paper
A ramsey-type bound for rectangles1997-04-07Paper
A Ramsey-type problem on right-angled triangles in space1996-09-01Paper
https://portal.mardi4nfdi.de/entity/Q48851861996-07-15Paper
Note on a Ramsey-type problem in geometry1994-12-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Géza Tóth