Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture

Recommendations

scientific article; zbMATH DE number 2156833
Zarankiewicz's conjecture is finite for each fixed \(m\)
Asymptotically settling Zarankiewicz's conjecture in finite time, for each \(m\)
Crossing number of the complete tripartite graph \(K_{1,10,n}\)
On the crossing number of the complete tripartite graph \(K_{1,8,n}\)

Cited in

(47)

A survey of graphs with known or bounded crossing numbers
On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
The crossing numbers of join products of paths with three graphs of order five
On the crossing number of join product of the discrete graph with special graphs of order five
On the crossing number of \(K_n\) without computer assistance
On the crossing number for Kronecker product of a tripartite graph with path
Asymptotically settling Zarankiewicz's conjecture in finite time, for each \(m\)
The crossing numbers of join products of four graphs of order five with paths and cycles
Book drawings of complete bipartite graphs
On Numerical Invariant of Graph
The crossing number of \(K_{1,m,n}\)
Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph
Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
Determining crossing number of join of the discrete graph with two symmetric graphs of order five
The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
Bicolored order types
Reduction of symmetric semidefinite programs using the regular -representation
Remarks on a conjecture of Barát and Tóth
A successful concept for measuring non-planarity of graphs: The crossing number.
Exploiting symmetry in copositive programs via semidefinite hierarchies
The crossing number of the Cartesian product of paths with complete graphs
New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
On the crossing numbers of join products of four graphs of order six with the discrete graph
The crossing numbers of join product of four graphs on six vertices with discrete graphs
On the crossing number of the join of the wheel on five vertices with the discrete graph
On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
The optimal drawings of \(K_{5,n}\)
[[:Publication:4959262|On problems of \(\mathcal{CF}\)-connected graphs for \({K}_Template:M,n \)]]
\( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
The crossing number of nearly complete bipartite graphs
Cyclic permutations in determining crossing numbers
The crossing number of \(K_{1,4,n}\)
The early history of the brick factory problem
The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles
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
DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
The crossing number of \(K_{5,n+1} \setminus e\)
On the crossing number of \(K_{13}\)
Zip product of graphs and crossing numbers
Zarankiewicz's conjecture is finite for each fixed \(m\)
The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph
Finding coherent cyclic orders in strong digraphs
Invariant Semidefinite Programs
The crossing number of \(K_{2,m}\square P_n\)
On the crossing numbers of loop networks and generalized Petersen graphs
Sketchy tweets: ten minute conjectures in graph theory

This page was built for publication: Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture

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