scientific article; zbMATH DE number 3140515
From MaRDI portal
Publication:3257129
Cited in
(21)- New results on finite polarized partition relations
- On a class of degenerate extremal graph problems
- A new result on the problem of Zarankiewicz
- A problem of Zarankiewicz
- Bounds on certain multiplications of affine combinations
- Intersections of longest cycles in \(k\)-connected graphs
- Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
- The number of copies of \(K_{2,t+1}\) in a graph
- Coding Strings by Pairs of Strings
- An almost naive algorithm for finding relative neighbourhood graphs in L_p metrics
- Colouring graphs with forbidden bipartite subgraphs
- Ramsey numbers of ordered graphs
- A connection between coding theory and polarized partition relations
- Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
- Exact values for some unbalanced Zarankiewicz numbers
- Mathematical aspects of concept analysis
- Coloring locally sparse graphs
- Improved upper bounds on Zarankiewicz numbers
- Improved upper bound for the size of a trifferent code
- Finding partite hypergraphs efficiently
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
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 Q3257129)
