Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
On the Problem of Relative Components of Minimal Graphs Read chapter Read first chapter

1990 | OriginalPaper | Chapter

A Recursive Bound for the Number of Complete K-Subgraphs of a Graph

Authors : R. Ahlswede, N. Cai, Z. Zhang

Published in: Topics in Combinatorics and Graph Theory

Publisher: Physica-Verlag HD

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

The following inequality was conceived as a tool in determining coloring numbers in the sense of Ahlswede, Cai, Zhang ([1]), but developed into something of a seemingly basic nature.

previous chapter Irregular Assignments and Two Problems à la Ringel
next chapter One-Factorizations of Tensor Products of Graphs
Metadata
Title
A Recursive Bound for the Number of Complete K-Subgraphs of a Graph
Authors
R. Ahlswede
N. Cai
Z. Zhang
Copyright Year
1990
Publisher
Physica-Verlag HD
Book
Topics in Combinatorics and Graph Theory

Print ISBN: 978-3-642-46910-7

Electronic ISBN: 978-3-642-46908-4

Copyright Year: 1990

DOI
https://doi.org/10.1007/978-3-642-46908-4_3

Premium Partner

    Image Credits