Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Posets in which every cutset meets every fibre

From MaRDI portal
Publication:1297476
Jump to:navigation, search

DOI10.1016/S0012-365X(98)80003-4zbMath0931.06002OpenAlexW62939286MaRDI QIDQ1297476

V. Pereyra

Publication date: 28 February 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)80003-4


zbMATH Keywords

series-parallel posetslexicographic sumcutset-meets-fiber posetsskeletal posetssum of antichains


Mathematics Subject Classification ID

Partial orders, general (06A06)


Related Items (2)

Unnamed Item ⋮ Every cutset meets every fibre in certain poset products



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A companion to Grillet's theorem on maximal chains and antichains
  • A note on maximal antichains in ordered sets
  • Every cutset meets every fibre in certain poset products
  • Maximal Chains and Antichains in Boolean Lattices


This page was built for publication: Posets in which every cutset meets every fibre

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1297476&oldid=13407877"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki