Problems and results in discrete mathematics
This is a collection of a large number of very challenging unsolved problems in number theory, geometry, and combinatorics, together with many valuable remarks on the sometimes rather long history and the present state of knowledge. The author has contributed to most of the problems in an essential way. This enables him to estimate their difficulty by offering certain amounts of money for their solution. It also results in a very lively style of presentation. As a rule, the author does not provide detailed bibliographical references. Instead, he recommends some books and papers containing more complete information. Unfortunately, there are some misprints. In particular, the lower bound (due to Berlekamp) for the number \(f(p,2)\) concerning van der Waerden's theorem on monochromatic arithmetic progressions of length \(p\) in a two- colouring of the integers should read \(p \cdot 2^p\) instead of \(p^{2^p}\).
- Graphs with linearly bounded Ramsey numbers
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3675978 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3497986 (Why is no real title available?)
- scientific article; zbMATH DE number 3450155 (Why is no real title available?)
- scientific article; zbMATH DE number 3243107 (Why is no real title available?)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Konvexe Fünfecke in ebenen Punktmengen
- On a Ramsey type theorem
- On chromatic number of graphs and set-systems
- On sums of a Sidon-sequence
- On the sum of a prime and of two powers of two
- Piercing convex sets
- Ramsey type theorems in the plane
- Separability properties of almost-disjoint families of sets
- Sets with No Empty Convex 7-Gons
- The Ramsey number of a graph with bounded maximum degree
- There exist \(6n/13\) ordinary points
- A counterexample to Aharoni's strongly maximal matching conjecture
- Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics
- scientific article; zbMATH DE number 3860065 (Why is no real title available?)
- scientific article; zbMATH DE number 5629242 (Why is no real title available?)
- scientific article; zbMATH DE number 3897012 (Why is no real title available?)
- Countable partitions of Euclidean space
- Sum of elements in finite Sidon sets
- Large almost monochromatic subsets in hypergraphs
- Cardinal invariants on Boolean algebras
- The intersection spectrum of 3‐chromatic intersecting hypergraphs
- The intersection spectrum of 3-chromatic intersecting hypergraphs
- Integers are not the sum of prime and power of some primes
- Counterexamples to conjectures on strong maximality and minimality
This page was built for publication: Problems and results in discrete mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344612)