Greedy balanced pairs in \(N\)-free ordered sets

DOI10.1016/j.dam.2020.10.026OpenAlexW3101863156MaRDI QIDQ2217505

Imed Zaguia

Publication date: 29 December 2020

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

Full work available at URL: https://arxiv.org/abs/2002.11604

zbMATH Keywords

ordered setlinear extensionbalanced pair1/3-2/3 conjecture\(N\)-free ordered setgreedy linear extension

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets
• Minimizing setups in ordered sets of fixed width
• On the greedy dimension of a partial order
• The number of depth-first searches of an ordered set
• Asymptotic enumeration of N-free partial orders
• The gold partition conjecture for 6-thin posets
• Minimizing the jump number for partially ordered sets: A graph-theoretic approach
• Greedy linear extensions to minimize jumps
• Constructing greedy linear extensions by interchanging chains
• N-free posets as generalizations of series-parallel posets
• Balance theorems for height-2 posets
• Balanced pairs in partial orders
• Semiorders and the 1/3-2/3 conjecture
• The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest
• The Information-Theoretic Bound is Good for Merging
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Optimal Linear Extensions by Interchanging Chains
• The Jump Number of Dags and Posets: An Introduction
• The 1/3–2/3 Conjecture for 5-Thin Posets
• Maximal chains and antichains

This page was built for publication: Greedy balanced pairs in \(N\)-free ordered sets