The following pages link to Géza Tóth (Q178539):
Displaying 50 items.
- Separating families of convex sets (Q364852) (← links)
- Monochromatic empty triangles in two-colored point sets (Q385155) (← links)
- A note on coloring line arrangements (Q405217) (← links)
- Drawing Hamiltonian cycles with no large angles (Q426910) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- Disjoint edges in topological graphs (Q547867) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- Modeling nematohydrodynamics in liquid crystal devices (Q696384) (← links)
- QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB (Q711125) (← links)
- Block partitions: an extended view (Q722349) (← links)
- Separation with restricted families of sets (Q739393) (← links)
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- Petruska's question on planar convex sets (Q776273) (← links)
- (Q854707) (redirect page) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q854708) (← links)
- How many ways can one draw a graph? (Q879163) (← links)
- Note on the pair-crossing number and the odd-crossing number (Q938304) (← links)
- Long alternating paths in bicolored point sets (Q941368) (← links)
- Decomposition of multiple coverings into many parts (Q955226) (← links)
- Towards the Albertson conjecture (Q976729) (← links)
- Degenerate crossing numbers (Q1014334) (← links)
- Graphs drawn with few crossings per edge (Q1272189) (← links)
- Ramsey-type results for geometric graphs. II (Q1272962) (← links)
- Note on a Ramsey-type problem in geometry (Q1320393) (← links)
- (Q1380814) (redirect page) (← links)
- Ramsey-type results for geometric graphs. I (Q1380815) (← links)
- A generalisation of the Erdős-Szekeres theorem to disjoint convex sets (Q1387855) (← links)
- Note on the Erdős-Szekeres theorem (Q1387857) (← links)
- Note on an art gallery problem (Q1388132) (← links)
- Unavoidable configurations in complete topological graphs (Q1423589) (← links)
- Erdős-Szekeres-type theorems for segments and noncrossing convex sets (Q1580260) (← links)
- New bounds on crossing numbers (Q1591053) (← links)
- Ramsey-type results for unions of comparability graphs (Q1606025) (← links)
- Domain motion in confined liquid crystals (Q1611645) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- An algorithm to find maximum area polygons circumscribed about a convex polygon (Q1727731) (← links)
- Geometric graphs with few disjoint edges (Q1809516) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Recognizing string graphs is decidable (Q1864118) (← links)
- Monotone paths in line arrangements (Q1869746) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- A Ramsey-type problem on right-angled triangles in space (Q1916097) (← links)
- Monotone crossing number (Q1946757) (← links)
- Note on geometric graphs (Q1971016) (← links)
- Wealth distribution in modern societies: collected data and a master equation approach (Q2078628) (← links)
- Crossing lemma for the odd-crossing number (Q2088881) (← links)
- Improvement on the crossing number of crossing-critical graphs (Q2117357) (← links)
- Scaling in income inequalities and its dynamical origin (Q2164943) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- Many touchings force many crossings (Q2312603) (← links)
