On a problem of P. Turan concerning graphs

Cited in

(74)

A survey of graphs with known or bounded crossing numbers
Rotation and crossing numbers for join products
On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
A Turán type problem concerning the powers of the degrees of a graph
The crossing number of Cartesian product of 5-wheel with any tree
scientific article; zbMATH DE number 3333192 (Why is no real title available?)
On the crossing number for Kronecker product of a tripartite graph with path
Asymptotically settling Zarankiewicz's conjecture in finite time, for each m
On Turán problems for Cartesian products of graphs
Book drawings of complete bipartite graphs
Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
The Crossing Number of Graphs: Theory and Computation
Bicolored order types
Reduction of symmetric semidefinite programs using the regular -representation
Graphs with at most one crossing
scientific article; zbMATH DE number 1843855 (Why is no real title available?)
Upper bound on the sum of powers of the degrees of graphs with few crossings per edge
Book embeddings and crossing numbers
The Join of Graphs and Crossing Numbers
Bounding the tripartite‐circle crossing number of complete tripartite graphs
A successful concept for measuring non-planarity of graphs: The crossing number.
Exploiting symmetry in copositive programs via semidefinite hierarchies
Copositive optimization -- recent developments and applications
The effect of planarization on width
New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
Planar crossing numbers of graphs of bounded genus
Efficient generation of different topological representations of graphs beyond-planarity
The crossing numbers of join of the special graph on six vertices with path and cycle
On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
Recent results in topological graph theory
Non-planar core reduction of graphs
Limiting Crossing Numbers for Geodesic Drawings on the Sphere
The optimal drawings of \(K_{5,n}\)
From art and circuit design to geometry and combinatorics
Different types of isomorphisms of drawings of complete multipartite graphs
[[:Publication:4959262|On problems of \(\mathcal{CF}\)-connected graphs for \({K}_Template:M,n \)]]
Das Geschlecht des vollständigen paaren Graphen
Gap-Planar Graphs
The crossing numbers of join of some graphs with n isolated vertices
The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
Topological Drawings of Complete Bipartite Graphs
Bounding the tripartite-circle crossing number of complete tripartite graphs
The crossing number of nearly complete bipartite graphs
Cyclic permutations in determining crossing numbers
Gap-planar graphs
The crossing number of locally twisted cubes \(L T Q_n\)
A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
The early history of the brick factory problem
On crossing numbers of geometric proximity graphs
The effect of planarization on width
Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\)
The tripartite-circle crossing number of graphs with two small partition classes
On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs
Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs
The bipartite-cylindrical crossing number of the complete bipartite graph
The crossing number of \(K_{5,n+1} \setminus e\)
An effective crossing minimisation heuristic based on star insertion
Turán problems for integer-weighted graphs
A note on isomorphic generalized Petersen graphs with an application to the crossing number of \(GP[3k-1,k]\) and \(GP[3k+1,k]\)
A Turán-type problem on distances in graphs
ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
A lower bound for the rectilinear crossing number
On the uncrossed number of graphs
Weighted Turán problems with applications
Turán Problems and Shadows III: Expansions of Graphs
Beyond-planarity: Turán-type results for non-planar bipartite graphs
On the biplanar and k-planar crossing numbers
The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph
On Turán's \((3,4)\)-problem with forbidden subgraphs
Invariant Semidefinite Programs
Efficient generation of different topological representations of graphs beyond-planarity
The crossing number of \(K_{2,m}\square P_n\)
Sketchy tweets: ten minute conjectures in graph theory
On crossing numbers of complete tripartite and balanced complete multipartite graphs

This page was built for publication: On a problem of P. Turan concerning graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5827570)