Homomorphic Compactness of Infinite Graphs
1997
- 1Usage
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Usage1
- Abstract Views1
Lecture / Presentation Description
The University of CalgaryIn 1951 de Bruijn and Erdös proved that an infinite graph is n-colourable if and only if each of its finite subgraphs is n- colourable. This is often referred to as 'compactness of n-colouring'. Using the fact that n-colouring is essentially identical to finding a graph homomorphism to a complete graph on n vertices, we say that a graph G is homomorphically compact if each infinite graph H admits a homomorphism to G exactly when all of its finite subgraphs admit such a homomorphism.We will show that (really) infinite compact graphs exist and explore various other problems related to them.
Bibliographic Details
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know