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

scientific article; zbMATH DE number 4200235

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

zbMATH Open0727.05031MaRDI QIDQ3348931FDOQ3348931


Authors: Ning Cai, Zhen Zhang, Rudolf Ahlswede Edit this on Wikidata


Publication date: 1990



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



Recommendations

  • scientific article; zbMATH DE number 3188526
  • Bounds on the number of complete subgraphs
  • An upper bound on the number of cliques in a graph
  • On the number of complete subgraphs and circuits contained in graphs
  • scientific article; zbMATH DE number 3843786


zbMATH Keywords

number of complete k-subgraphs of a graph


Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)



Cited In (4)

  • Handle bases and bounds on the number of subgraphs
  • The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver
  • A Remark on the Number of Complete and Empty Subgraphs
  • Bounds on the number of complete subgraphs





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 Q3348931)

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