Induced Decompositions of Graphs
Copyright policy )Induced Decompositions of Graphs
AbstractWe consider those graphs G that admit decompositions into copies of a fixed graph F, each copy being an induced subgraph of G. We are interested in finding the extremal graphs with this property, that is, those graphs G on n vertices with the maximum possible number of edges. We discuss the cases where F is a complete equipartite graph, a cycle, a star, or a graph on at most four vertices.
- Federal University of Rio de Janeiro Brazil
- Sorbonne Paris Cité France
- Sorbonne University France
Extremal problems in graph theory, decomposition, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), induced subgraph, extremal graph theory
Extremal problems in graph theory, decomposition, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), induced subgraph, extremal graph theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!