Polygonal graphs as ordered sets: the Sperner criterion

DOI10.18500/1816-9791-2016-16-2-226-231MaRDI QIDQ2830940zbMATH OpenOpenAlexFDO

Authors V. N. Saliĭ

Publication date 1 November 2016

Published in Izvestiya Saratovskogo Universiteta. Novaya Seriya. Seriya Matematika, Mekhanika, Informatika (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.18500/1816-9791-2016-16-2-226-231

zbMATH Keywords

partially ordered setpathpolygonal graphSperner propertyzigzag

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorics of partially ordered sets (06A07) Applications of graph theory to circuits and networks (94C15)

Recommendations

• The poset on connected graphs is Sperner
• scientific article; zbMATH DE number 3861193
• scientific article; zbMATH DE number 3877243
• The poset on connected induced subgraphs of a graph need not be Sperner
• scientific article; zbMATH DE number 3851159

Cited in

(6)

• The poset on connected graphs is Sperner
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
• scientific article; zbMATH DE number 3861193 (Why is no real title available?)
• scientific article; zbMATH DE number 3877243 (Why is no real title available?)
• The ordered set of connected parts of a polygonal graph
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial

This page was built for publication: Polygonal graphs as ordered sets: the Sperner criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830940)