On the Erdős-Tuza-Valtr conjecture
From MaRDI portal
(Redirected from On the Erdős-Tuza-Valtr conjecture)
Recommendations
Cites work
- A combinatorial problem in geometry.
- A SAT attack on the Erdős-Szekeres conjecture
- An improved upper bound for the Erdős-Szekeres conjecture
- Computer solution to the 17-point Erdős-Szekeres problem
- Erdős-Szekeres without induction
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Finding convex sets among points in the plane
- Forced convex n-gons in the plane
- Formal proof
- Formal proof -- theory and practice
- HOL Light: An Overview
- scientific article; zbMATH DE number 5019923 (Why is no real title available?)
- Isabelle/HOL. A proof assistant for higher-order logic
- Note on the Erdős-Szekeres theorem
- On the Erdős-Szekeres convex polygon problem
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Ramsey-remainder
- The Lean theorem prover (system description)
- Two extensions of the Erdős-Szekeres problem
This page was built for publication: On the Erdős-Tuza-Valtr conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655707)