Proper containment of interval filament graphs in co-strongly pseudo transitive graphs
Proper containment of interval filament graphs in co-strongly pseudo transitive graphs
An interval filament graph is a graph admitting a representation by curves associated with intervals on the real line, where each curve lies above its interval and connects its endpoints. A graph is co-strongly pseudo transitive of the first type when its non-edges admit an orientation whose associated directed acyclic graph is strongly pseudo transitive of the first type.
Containment conjecture. The class of interval filament graphs is properly contained in the class of co-strongly pseudo transitive graphs of the first type.
The claim asserts both that every interval filament graph belongs to the latter class and that the containment is strict. The supplied excerpt does not indicate whether this statement has been proved or remains open.
Sources & referencesView supporting material
Primary source
Farhad Shahrokhi, “Strong Pseudo Transitivity and Intersection Graphs”, arXiv:1806.01378 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.