Simple extensions of combinatorial structures

@inproceedings{Brignall2009SimpleEO,
  title={Simple extensions of combinatorial structures},
  author={Robert Brignall},
  year={2009}
}
An interval in a combinatorial structure R is a set I of points which are related to every point in R \ I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a simple structure by structures of smaller sizes — this is called the substitution (or modular) decomposition. In this paper we prove several results of the following type: An arbitrary structure S of size n belonging to a class C can be embedded into a… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Algorithmic aspects of comparability graphs and interval graphs. In Graphs and order (Banff, Alta

  • R. H. MÖHRING
  • vol. 147 of NATO Adv. Sci. Inst. Ser. C Math…
  • 1984
Highly Influential
4 Excerpts

An algebraic decomposition theory for discrete structures. In Universal algebra and its links with logic, algebra, combinatorics and computer science

  • R. H. MÖHRING
  • (Darmstadt,
  • 1983
Highly Influential
4 Excerpts

On the distribution of locally undecomposable relations and independence systems

  • R. H. MÖHRING
  • In Colloquium on Mathematical Methods of…
  • 1980
Highly Influential
4 Excerpts

A translation of T. Gallai’s paper: “Transitiv orientierbare Graphen

  • T. GALLAI
  • Wiley- Intersci. Ser. Discrete Math. Optim. Wiley…
  • 2001
1 Excerpt

Indecomposable graphs

  • P. I LLE
  • Discrete Math .
  • 2001

Similar Papers

Loading similar papers…