z-logo
open-access-imgOpen Access
Topological Properties of Event Structures
Author(s) -
Luigi Santocanale
Publication year - 2009
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2009.02.023
Subject(s) - antichain , event structure , combinatorics , clique graph , mathematics , split graph , degree (music) , event (particle physics) , graph , clique , block graph , induced subgraph , discrete mathematics , topology (electrical circuits) , computer science , line graph , pathwidth , partially ordered set , physics , voltage graph , statistics , quantum mechanics , acoustics , vertex (graph theory)
Motivated by the nice labelling problem for event structures, we study the topological properties of the associated graphs. For each n⩾0, we exhibit a graph Gn that cannot occur on an antichain as a subgraph of the graph of an event structure of degree n. The clique complexes of the graphs Gn are disks (n even) and spheres (n odd) in increasing dimensions. We strengthen the result for event structures of degree 3: cycles of length greater than 3 do not occur on antichains as subgraphs. This amounts to saying that the clique complex of the graph of an event structure of degree 3 is acyclic

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom