On chain and antichain families of a partially ordered set
From MaRDI portal
Publication:1144050
DOI10.1016/0095-8956(80)90079-9zbMath0443.06003OpenAlexW2004594020MaRDI QIDQ1144050
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90079-9
Related Items
On k-optimum dipath partitions and partial k-colourings of acyclic digraphs, An efficiently solvable graph partition problem to which many problems are reducible, Reconfiguration of colorable sets in classes of perfect graphs, Single step searching in weighted block graphs, Scheduling jobs with fixed start and end times, Inverse chromatic number problems in interval and permutation graphs, Note on maximal split-stable subgraphs, Families of chains of a poset and Sperner properties, The maximum k-colorable subgraph problem for chordal graphs, Fixed interval scheduling: models, applications, computational complexity and algorithms, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, Approximation results for the optimum cost chromatic partition problem, Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization, Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey, The just-in-time scheduling problem in a flow-shop scheduling system, Graph coloring with rejection, Berge's conjecture on directed path partitions -- a survey, Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems, 4-connected triangulations on few lines, The maximum vertex coverage problem on bipartite graphs, k-optimal partitions of a directed graph, Solving the single step graph searching problem by solving the maximum two-independent set problem, Proof of Berge's strong path partition conjecture for \(k=2\), Stability number and chromatic number of tolerance graphs, Coflow polyhedra, A unified approach to known and unknown cases of Berge's conjecture, The 0-1 inverse maximum stable set problem, On Greene-Kleitman's theorem for general digraphs, Greene-Kleitman's theorem for infinite posets, Finite posets and Ferrers shapes, Just-in-time scheduling with controllable processing times on parallel machines, Unnamed Item, On the size of maximal chains and the number of pairwise disjoint maximal antichains, The bounds for the number of linear extensions via chain and antichain coverings, Research problems, “Rent-or-Buy” Scheduling and Cost Coloring Problems, Note on scheduling intervals on-line, Weighted sum coloring in batch scheduling of conflicting jobs, On Path Partitions and Colourings in Digraphs, Approximating minimum cocolorings., Covering Graphs by Colored Stable Sets, ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible, Some sequences associated with combinatorial structures
Cites Work
