A new characterization of \(\mathcal{V} \)-posets

DOI10.1007/s11083-019-09510-6zbMath1456.06001arXiv1810.07276OpenAlexW2999159987MaRDI QIDQ781541

Joshua N. Cooper, Peter Gartland, Hays Whitlatch

Publication date: 17 July 2020

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

posetgraph theoryrecognition algorithm\(N\)-freebowtie-freepressing sequence

Mathematics Subject Classification ID

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

Related Items (2)

On the transitivity coefficients for minimal posets with nonpositive quadratic Tits form ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Successful pressing sequences for a bicolored graph and binary matrices
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Counting linear extensions
• Order quasisymmetric functions distinguish rooted trees
• Uniquely pressable graphs: characterization, enumeration, and recognition
• Transforming cabbage into turnip
• The Recognition of Series Parallel Digraphs
• Faster integer multiplication using plain vanilla FFT primes

This page was built for publication: A new characterization of \(\mathcal{V} \)-posets