Abstract
In this paper we study an interesting class of graph parameters. These parameters arise both from edge coloring models and from limits of vertex coloring models with a fixed number of vertices. Their vertex connection matrices have exponentially bounded rank growth.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Preedman, L. Lovász and A. Schrijver, Reflection positivity, rank connectivity, and homomorphism of graphs, J. Amer. Math. Soc, 20 (2007), no. 1, 37–51.
B. Szegedy, Edge coloring models and reflection positivity, J. Amer. Math. Soc, 20 (2007), no. 4, 969–988.
W. Gröbner, Algebraische Geometrie II, Bibliographisches Institut, Mannheim, 1970.
I. Kaplansky, Commutative Rings, The University of Chicago Press, Chicago, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 János Bolyai Mathematical Society and Springer-Verlag
About this chapter
Cite this chapter
Szegedy, B. (2010). Edge Coloring Models as Singular Vertex Coloring Models. In: Katona, G.O.H., Schrijver, A., Szőnyi, T., Sági, G. (eds) Fete of Combinatorics and Computer Science. Bolyai Society Mathematical Studies, vol 20. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13580-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-13580-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13579-8
Online ISBN: 978-3-642-13580-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)