scientific article; zbMATH DE number 4164941
From MaRDI portal
Publication:3491635
Lists of open problems (00A27) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)
Cited in
(31)- Unit distances and diameters in Euclidean spaces
- Colourings of graphs with two consecutive odd cycle lengths
- Problems which interest and/or annoy me
- Derivatives of Faber polynomials and Markov inequalities
- Cycle lengths and chromatic number of graphs
- On the Erdös-diameter of sets
- Lemniscate zone and distortion theorems for multivalent functions
- Component edge connectivity of hypercube-like networks
- Distortion and critical values of the finite Blaschke product
- On the growth rate of chromatic numbers of finite subgraphs
- Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
- Bounding the size of the subgraph induced by \(m\) vertices and extra edge-connectivity of hypercubes
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Distortion theorem for complex polynomials
- scientific article; zbMATH DE number 981684 (Why is no real title available?)
- Large gaps between consecutive prime numbers
- Long gaps between primes
- Tao's resolution of the Erdős discrepancy problem
- Coloring graphs with two odd cycle lengths
- ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
- The critical window for the classical Ramsey-Turán problem
- An extremal problem for the derivative of a rational function
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
- Prime avoiding numbers form a basis of order 2
- Highly symmetric subgraphs of hypercubes
- An explicit lower bound for large gaps between some consecutive primes
- Hyperplane covers of finite spaces and applications
- Some exact results on 4-cycles: stability and supersaturation
- \(C_{10}\) has positive Turán density in the hypercube
- 3-coloring P_t-free graphs with only one prescribed induced odd cycle length
- Turán's theorem for pseudo-random graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3491635)
