Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article

From MaRDI portal
Publication:3257129
Jump to:navigation, search

zbMATH Open0086.01202MaRDI QIDQ3257129FDOQ3257129

Carl Hyltén-Cavallius

Publication date: 1958


Full work available at URL: https://eudml.org/doc/210386

Title of this publication is not available (Why is that?)


zbMATH Keywords

combinatorics



Cited In (17)

  • Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\)
  • A new result on the problem of Zarankiewicz
  • A problem of Zarankiewicz
  • Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
  • A connection between coding theory and polarized partition relations
  • Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices
  • Coding Strings by Pairs of Strings
  • Colouring graphs with forbidden bipartite subgraphs
  • The number of copies of \(K_{2,t+1}\) in a graph
  • Exact values for some unbalanced Zarankiewicz numbers
  • An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics
  • Bounds on certain multiplications of affine combinations
  • New results on finite polarized partition relations
  • Ramsey numbers of ordered graphs
  • Intersections of longest cycles in \(k\)-connected graphs
  • Mathematical aspects of concept analysis
  • On a class of degenerate extremal graph problems






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3257129&oldid=16448250"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 10:35. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki