Unique Factorization Theorem and Formal Concept Analysis

In the theory of generalised colourings of graphs, the Unique Factorization Theorem (UFT) for additive induced-hereditary properties of graphs provides an analogy of the well-known Fundamental Theorem of Arithmetics. The purpose of this paper is to present a new, less complicated, proof of this theorem that is based on Formal Concept Analysis. The method of the proof can be successfully applied even for more general mathematical structures known as relational structures.

[1]  Uppaluri S. R. Murty,et al.  Graph Theory with Applications , 1978 .

[2]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[3]  Stanislav Krajci,et al.  A Generalized Concept Lattice , 2005, Log. J. IGPL.

[4]  Marietjie Frick,et al.  A survey of hereditary properties of graphs , 1997, Discuss. Math. Graph Theory.

[5]  Alastair Farrugia.  Vertex-Partitioning into Fixed Additive Induced-Hereditary Properties is NP-hard , 2004, Electron. J. Comb..

[6]  Peter Mihók,et al.  Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties , 2002, Discuss. Math. Graph Theory.

[7]  Peter Mihók,et al.  Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors , 2000, J. Graph Theory.

[8]  Edward R. Scheinerman,et al.  On the structure of hereditary classes of graphs , 1986 .

[9]  R. Bruce Richter,et al.  Unique factorisation of additive induced-hereditary properties , 2004, Discuss. Math. Graph Theory.

[10]  Robert Cowen,et al.  GRAPH COLORING COMPACTNESS THEOREMS EQUIVALENT TO BPI , 2002 .

[11]  Peter Mihók,et al.  Unique factorization theorem , 2000, Discuss. Math. Graph Theory.

[12]  R. Bruce Richter,et al.  Factorizations and characterizations of induced-hereditary and compositive properties , 2003 .

[13]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[14]  Peter Mihók,et al.  Factorizations and characterizations of induced-hereditary and compositive properties , 2005, J. Graph Theory.

[15]  Norbert Sauer.  Canonical Vertex Partitions , 2003, Comb. Probab. Comput..

[16]  Peter Mihók,et al.  On uniquely partitionable relational structures and object systems , 2006, Discuss. Math. Graph Theory.

[17]  Peter Mihók,et al.  Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors , 2000 .

[18]  R. Bruce Richter,et al.  Uniqueness and complexity in generalised colouring , 2003 .

[19]  J. Jakubík,et al.  On the lattice of additive hereditary properties of finite graphs , 2002 .