The following pages link to Jan Kynčl (Q322284):
Displaying 50 items.
- Improved enumeration of simple topological graphs (Q377494) (← links)
- Graph sharing games: complexity and connectivity (Q391088) (← links)
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension (Q439058) (← links)
- On three measures of non-convexity (Q522338) (← links)
- Monochromatic triangles in two-colored plane (Q624214) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- Ramsey-type constructions for arrangements of segments (Q661941) (← links)
- Bounds for Pach's selection theorem and for the minimum solid angle in a simplex (Q745666) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Long alternating paths in bicolored point sets (Q941368) (← links)
- The maximum piercing number for some classes of convex sets with the \((4,3)\)-property (Q1010733) (← links)
- On edges crossing few other edges in simple topological complete graphs (Q1011770) (← links)
- The hamburger theorem (Q1699288) (← links)
- On the growth of the Möbius function of permutations (Q2010617) (← links)
- On crossing-families in planar point sets (Q2144455) (← links)
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors (Q2167311) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4 (Q2300157) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- Saturated simple and \(k\)-simple topological graphs (Q2344053) (← links)
- On the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\) (Q2363691) (← links)
- Improvement on the decay of crossing numbers (Q2376099) (← links)
- Near equipartitions of colored point sets (Q2401334) (← links)
- Unified Hanani-Tutte theorem (Q2401398) (← links)
- Universal Sets for Straight-Line Embeddings of Bicolored Graphs (Q2849801) (← links)
- Clustered Planarity Testing Revisited (Q2936950) (← links)
- Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case (Q2947545) (← links)
- Simple Realizability of Complete Abstract Topological Graphs Simplified (Q2959766) (← links)
- (Q3060858) (← links)
- Probabilistic strategies for the partition and plurality problems (Q3419612) (← links)
- Graph Sharing Games: Complexity and Connectivity (Q3569088) (← links)
- On Three Parameters of Invisibility Graphs (Q3578316) (← links)
- Hamiltonian Alternating Paths on Bicolored Double-Chains (Q3611851) (← links)
- Solution of Peter Winkler’s Pizza Problem (Q3651562) (← links)
- Irreversible 2-conversion set in graphs of bounded degree (Q4560206) (← links)
- Hardness of Permutation Pattern Matching (Q4575761) (← links)
- Better upper bounds on the Füredi-Hajnal limits of permutations (Q4575898) (← links)
- A superlinear lower bound on the number of 5-holes (Q4580080) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q4635546) (← links)
- (Q5088969) (← links)
- Hanani-Tutte for approximating maps of graphs (Q5115807) (← links)
- The $\mathbb{Z}_2$-genus of Kuratowski minors (Q5115808) (← links)
- On planar point sets with the pentagon property (Q5174465) (← links)
- 6-Critical Graphs on the Klein Bottle (Q5189524) (← links)
- ZEROS OF THE MÖBIUS FUNCTION OF PERMUTATIONS (Q5230053) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
- Ramsey-type constructions for arrangements of segments (Q5301021) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- (Q5419964) (← links)
