The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges

DOI10.1016/0095-8956(77)90039-9zbMath0368.05032OpenAlexW2150522168WikidataQ55966565 ScholiaQ55966565MaRDI QIDQ1242929

Robert James Douglas

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90039-9

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• On the edge-chromatic number of a graph
• On maximal paths and circuits of graphs
• Almost all Graphs have a Spanning Cycle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges