Skip to main content
Springer Nature Link
Log in

The Fixed Vertex Property for Graphs

  • Published:
Order Aims and scope Submit manuscript

Abstract

Analogous to the fixed point property for ordered sets, a graph has the fixed vertex property iff each of its endomorphisms has a fixed vertex. The fixed point theory for ordered sets can be embedded into the fixed vertex theory for graphs. Therefore, the potential for cross-fertilization should be explored.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abian, S., Brown, A.B.: A theorem on partially ordered sets with applications to fixed point theorems. Canad. J. Math. 13, 78–82 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  2. Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the 15th IJCAI international joint conference on artificial intelligence. IJCAI, pp 412–417 (1997)

  3. Duffus, D., Goddard, T.: The complexity of the fixed point property. Order 13, 209–218 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hazan, S., Neumann-Lara, V.: Fixed points of posets and clique graphs. Order 13, 219–225 (1995)

    MathSciNet  Google Scholar 

  5. Hell, P., Nešetril, J.: Graphs and homomorphisms. Oxford lecture series in mathematics and its applications 28. Oxford University Press, Oxford (2004)

    Google Scholar 

  6. Höft, H., Höft, M.: Fixed point invariant reductions and a characterization theorem for lexicographic sums. Houst. J. Math. 14(3), 411–422 (1988)

    MATH  Google Scholar 

  7. Larose, B., Tardif, C.: Hedetniemi?s conjecture and the retracts of a product of graphs. Combinatorica 20(4), 531–544 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Maróti, M., Zádori, L.: Reflexive digraphs with near unanimity polymorphisms. Discrete Math. 312, 2316–2328 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  9. McKay, B.: Combinatorial Data. http://cs.anu.edu.au/bdm/data/ (2013)

  10. Rival, I.: A fixed point theorem for finite partially ordered sets. J.Comb. Theory (A) 21, 309–318 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  11. Roddy, M. Fixed points and products Order 11, 11–14 (1994)

    MATH  MathSciNet  Google Scholar 

  12. Roddy, M.: Fixed points and products: width 3. Order 19, 319–326 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Roddy, M.: On an example of Rutkowski and Schröder. Order 19, 365–366 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  14. Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier, Amsterdam (2006)

    MATH  Google Scholar 

  15. Rutkowski, A.: The fixed point property for small sets. Order 6, 1–14 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. Schröder, B.: Fixed point property for 11-element sets. Order 10, 329–347 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Schröder, B.: Algorithms for the fixed point property. Theor. Comput. Sci. 217, 301–358 (1996). also available at http://www.csi.uottawa.ca/ordal/papers/schroder/FINSURVE.html

    Article  Google Scholar 

  18. Schröder, B.: Ordered Sets – An Introduction. Birkhäuser, Boston (2003)

    Book  MATH  Google Scholar 

  19. Schröder, B.: Examples of powers of Ordered Sets with the Fixed Point Property. Order 23, 211–219 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  20. Schröder, B.: The fixed point property for ordered sets. Arabian Journal of Mathematics in press (2012). currently available through open access. http://www.springerlink.com/content/x772r85275x13hgu/

  21. Schröder, B.: Homomorphic Constraint Satisfaction Problem Solver. http://www.math.usm.edu/schroeder/software.htm (2014)

  22. Tsang, E.: Foundations of constraint satisfaction. Academic Press, New York (1993). Out of print. Pdfs available from the author at http://www.bracil.net/edward/FCS.html

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Southern Mississippi, 118 College Avenue, #5045, Hattiesburg, MS, 39406, USA

    Bernd S. W. Schröder

Authors
  1. Bernd S. W. Schröder
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Bernd S. W. Schröder.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Schröder, B.S.W. The Fixed Vertex Property for Graphs. Order 32, 363–377 (2015). https://doi.org/10.1007/s11083-014-9337-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-014-9337-5

Keywords