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

Partitions of a finite three-complete poset

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

DOI10.1016/0012-365X(94)00170-NzbMath0842.06001MaRDI QIDQ1910551

Shiojenn Tseng, Muh-Chyi Horng

Publication date: 24 March 1996

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


zbMATH Keywords

partitionfinite posetthree-complete set


Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Graph theory (05C99)


Related Items (1)

A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)



Cites Work

  • The XYZ conjecture and the FKG inequality
  • Order Preserving Maps and Linear Extensions of a Finite Poset
  • A Monotonicity Property of Partial Orders
  • Some Monotonicity Properties of Partial Orders
  • The FKG Inequality and Some Monotonicity Properties of Partial Orders
  • Correlation Among Partial Orders


This page was built for publication: Partitions of a finite three-complete poset

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