On a problem of P. Turan concerning graphs
From MaRDI portal
Publication:5827570
DOI10.4064/fm-41-1-137-145zbMath0055.41605OpenAlexW824928995MaRDI QIDQ5827570
Publication date: 1954
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213338
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Unnamed Item, Cyclic permutations in determining crossing numbers, The crossing numbers of join of some graphs with \(n\) isolated vertices, Das Geschlecht des vollständigen paaren Graphen, Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation, The crossing number of locally twisted cubes \(L T Q_n\), Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs, Recent results in topological graph theory, The crossing number of \(K_{5,n+1} \setminus e\), Bounding the tripartite‐circle crossing number of complete tripartite graphs, From art and circuit design to geometry and combinatorics, Topological Drawings of Complete Bipartite Graphs, Copositive optimization -- recent developments and applications, Sketchy tweets: ten minute conjectures in graph theory, Book embeddings and crossing numbers, On crossing numbers of geometric proximity graphs, The early history of the brick factory problem, Efficient generation of different topological representations of graphs beyond-planarity, Rotation and crossing numbers for join products, Book drawings of complete bipartite graphs, On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs, Planar crossing numbers of graphs of bounded genus, The crossing number of Cartesian product of 5-wheel with any tree, Unnamed Item, A successful concept for measuring non-planarity of graphs: The crossing number., The optimal drawings of \(K_{5,n}\), Gap-Planar Graphs, The Effect of Planarization on Width, Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity, On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\), Unnamed Item, The crossing numbers of join of the special graph on six vertices with path and cycle, Upper bound on the sum of powers of the degrees of graphs with few crossings per edge, Unnamed Item, Unnamed Item, Gap-planar graphs, The Effect of Planarization on Width, The crossing number of \(K_{2,m}\square P_n\), On the crossing number for Kronecker product of a tripartite graph with path, Invariant Semidefinite Programs, ON PROBLEMS OF -CONNECTED GRAPHS FOR, The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds, Non-planar core reduction of graphs, A survey of graphs with known or bounded crossing numbers, Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\), The bipartite-cylindrical crossing number of the complete bipartite graph, The Crossing Number of Graphs: Theory and Computation, Weighted Turán problems with applications, Graphs with at most one crossing, An effective crossing minimisation heuristic based on star insertion, On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n}, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, A lower bound for the rectilinear crossing number, Limiting Crossing Numbers for Geodesic Drawings on the Sphere, The Join of Graphs and Crossing Numbers, Exploiting symmetry in copositive programs via semidefinite hierarchies
