On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (Q1061752): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4198785 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simplicial decompositions of graphs - some uniqueness results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on universal graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3929755 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4117857 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simplicial Decompositions: Some New Aspects and Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3342616 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universal graphs and universal functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank | |||
Normal rank |
Latest revision as of 18:25, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the problem of finding small subdivision and homomorphism bases for classes of countable graphs |
scientific article |
Statements
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (English)
0 references
1985
0 references
Let \({\mathcal G}\) be a class of countable graphs given by a set \(\Gamma\) of forbidden configurations. We consider the following problem: for which \(\Gamma\) is \({\mathcal G}\) well characterized by the simplicial decompositions of its members into prime graphs, that is for which \({\mathcal G}\) is it possible to find a small subset \({\mathcal B}\) of \({\mathcal G}\) such that all graphs of \({\mathcal G}\) can be constructed from elements of \({\mathcal B}\) by successive amalgamations identifying complete subgraphs?
0 references
homomorphism base
0 references
subcontraction
0 references
countable graphs
0 references
forbidden configurations
0 references
simplicial decompositions
0 references
prime graphs
0 references