scientific article; zbMATH DE number 863477
From MaRDI portal
Publication:4871756
\({1\over 3}\)-\({2\over 3}\) conjecturebalancing pairscorrelationcross cut conjecturedegrees of freedomDilworth's theoremdimensionGreene-Kleitman theoreminterval ordersKierstead's chain partitioning theoremlinear extensionsmonotone chainsopen problemspartially ordered setsplanarityposets of bounded degreeregressionsemiordersSperner's lemma
Recommendations
Cited in
(66)- Correlation in partially ordered sets
- Balanced pairs in partial orders
- Finite three-dimensional partial orders which are not sphere orders
- Incidence posets of trees in posets of large dimension
- The lattice of \(N\)-run orthogonal arrays
- Trees and circle orders
- Dimension of posets with planar cover graphs excluding two long incomparable chains
- Asymptotics of the number of standard Young tableaux of skew shape
- Ordered sets
- Partially homogeneous partially ordered sets
- Balancing pairs and the cross product conjecture
- On-line dimension for posets excluding two long incomparable chains
- Sorting probability of Catalan posets
- Encoding and ordering X-cactuses
- Counting embeddings of rooted trees into families of rooted trees
- Skew shape asymptotics, a case-based introduction
- 4-connected triangulations on few lines
- Counting linear extensions of restricted posets
- The graph of critical pairs of a crown
- Standard examples as subposets of posets.
- The dimension of posets with planar cover graphs.
- On-line dimension of semi-orders
- On the dimension of posets with cover graphs of treewidth 2
- Dimension and height for posets with planar cover graphs.
- The numbers of shared upper bounds determine a poset
- Adjacency posets of outerplanar graphs
- ILP formulations for scheduling ordered tasks on a bounded number of processors
- A subexponential upper bound for the on-line chain partitioning problem
- News about semiantichains and unichain coverings.
- Planar posets, dimension, breadth and the number of minimal elements
- The Flow Set with Partial Order
- scientific article; zbMATH DE number 3963888 (Why is no real title available?)
- scientific article; zbMATH DE number 4085656 (Why is no real title available?)
- Algebraic properties of classes of path ideals of posets
- On the online track assignment problem
- scientific article; zbMATH DE number 1293817 (Why is no real title available?)
- PARTIALLY ORDERED CONNECTIVES
- scientific article; zbMATH DE number 702028 (Why is no real title available?)
- scientific article; zbMATH DE number 736305 (Why is no real title available?)
- Roman domination excellent graphs: trees
- C-complete sets for compromise stable games
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- The Induced Partial Order on the set of Finite Subsets of a Partially Ordered Set
- Block circulant graphs and the graphs of critical pairs of crowns
- Sorting probability for large Young diagrams
- Partially ordered sets and lattices
- Characterizing graphs of critical pairs of layered generalized crowns
- Posets and planar graphs
- scientific article; zbMATH DE number 3301444 (Why is no real title available?)
- Dimension and matchings in comparability and incomparability graphs.
- Log-concave poset inequalities (extended abstract)
- Multivariate correlation inequalities for \(P\)-partitions
- The space of equidistant phylogenetic cactuses
- Log-concave poset inequalities
- Linear extensions and continued fractions
- Computational complexity of counting coincidences
- Correlation inequalities for linear extensions
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy
- Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups
- On the cross-product conjecture for the number of linear extensions
- How neural networks work: unraveling the mystery of randomized neural networks for functions and chaotic dynamical systems
- The bend number of cocomparability graphs
- On-line chain partitions of orders: a survey
- Minimum spanning trees in networks with varying edge weights
- Schnyder woods and orthogonal surfaces
- Adjacency posets of planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871756)
