scientific article
From MaRDI portal
Publication:3491635
zbMath0709.11003MaRDI QIDQ3491635
No author found.
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Lists of open problems (00A27)
Related Items (24)
Distortion and critical values of the finite Blaschke product ⋮ Cycle lengths and chromatic number of graphs ⋮ Large gaps between consecutive prime numbers ⋮ Distortion theorem for complex polynomials ⋮ ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE ⋮ On the Erdös-diameter of sets ⋮ Turán's theorem for pseudo-random graphs ⋮ On the growth rate of chromatic numbers of finite subgraphs ⋮ Derivatives of Faber polynomials and Markov inequalities ⋮ Long gaps between primes ⋮ On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory ⋮ Tao’s resolution of the Erdős discrepancy problem ⋮ Coloring Graphs with Two Odd Cycle Lengths ⋮ 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 ⋮ Lemniscate zone and distortion theorems for multivalent functions ⋮ The critical window for the classical Ramsey-Turán problem ⋮ An extremal problem for the derivative of a rational function ⋮ Highly symmetric subgraphs of hypercubes ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Unit distances and diameters in Euclidean spaces ⋮ Prime avoiding numbers form a basis of order 2 ⋮ Colourings of graphs with two consecutive odd cycle lengths ⋮ Component edge connectivity of hypercube-like networks
This page was built for publication:
