On the Erdős-Tuza-Valtr conjecture

DOI10.1016/J.EJC.2024.104085MaRDI QIDQ6655707

Jineon Baek

Publication date: 27 December 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer science (68-XX) Differential geometry (53-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved upper bound for the Erdős-Szekeres conjecture
• Erdős-Szekeres without induction
• Forced convex \(n\)-gons in the plane
• Finding convex sets among points in the plane
• Note on the Erdős-Szekeres theorem
• Isabelle/HOL. A proof assistant for higher-order logic
• Ramsey-remainder
• Two extensions of the Erdős-Szekeres problem
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• A combinatorial problem in geometry.
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• HOL Light: An Overview
• The Lean Theorem Prover (System Description)
• Computer solution to the 17-point Erdős-Szekeres problem
• On the Erdős-Szekeres convex polygon problem
• A SAT attack on the Erdős-Szekeres conjecture

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)