The following pages link to Sergey Kitaev (Q284735):
Displaying 50 items.
- Rationality, irrationality, and Wilf equivalence in generalized factor order (Q2380324) (← links)
- Classifying descents according to parity (Q2385102) (← links)
- A note on \(p\)-ascent sequences (Q2404824) (← links)
- A comprehensive introduction to the theory of word-representable graphs (Q2408791) (← links)
- On \(k\)-\(11\)-representable graphs (Q2416927) (← links)
- Riordan graphs. II: Spectral properties (Q2419066) (← links)
- Quadrant marked mesh patterns in alternating permutations (Q2439097) (← links)
- Quadrant marked mesh patterns in alternating permutations. II (Q2443434) (← links)
- Restricted non-separable planar maps and some pattern avoiding permutations (Q2444543) (← links)
- On uniquely \(k\)-determined permutations (Q2477375) (← links)
- Classifying descents according to equivalence \(\operatorname{mod} k\) (Q2500983) (← links)
- On the number of self-dual rooted maps (Q2509764) (← links)
- Partially ordered generalized patterns (Q2566285) (← links)
- Classification of bijections between 321- and 132-avoiding permutations (Q2654626) (← links)
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations (Q2657073) (← links)
- On properly ordered coloring of vertices in a vertex-weighted graph (Q2665834) (← links)
- On permutations avoiding partially ordered patterns defined by bipartite graphs (Q2684900) (← links)
- On five types of crucial permutations with respect to monotone patterns (Q2692179) (← links)
- (Q2819395) (← links)
- UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS (Q2874053) (← links)
- Boolean complexes for Ferrers graphs (Q3001197) (← links)
- Avoiding substrings in compositons (Q3015585) (← links)
- (Q3024022) (← links)
- (Q3077260) (← links)
- (Q3077325) (← links)
- (Q3077340) (← links)
- (Q3077341) (← links)
- (Q3084740) (← links)
- A direct encoding of Stoimenow's matchings as ascent sequences (Q3090464) (← links)
- Alternation Graphs (Q3104776) (← links)
- (Q3115010) (← links)
- Solving computational problems in the theory of word-representable graphs (Q3120420) (← links)
- (Q3176569) (← links)
- (Q3176594) (← links)
- Quadrant marked mesh patterns in 132-avoiding permutations III (Q3196523) (← links)
- On universal partial words for word-patterns and set partitions (Q3298125) (← links)
- (Q3415020) (← links)
- Counting Ordered Patterns in Words Generated by Morphisms (Q3540121) (← links)
- Equidistribution of (X,Y)-descents, (X,Y)-adjacent pairs, and (X,Y)-place-value pairs on permutations (Q3550072) (← links)
- Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns (Q3560002) (← links)
- (Q3575428) (← links)
- Graphs Capturing Alternations in Words (Q3584914) (← links)
- Crucial Words for Abelian Powers (Q3637231) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- On universal partial words (Q4558959) (← links)
- (Q4584061) (← links)
- (Q4584085) (← links)
- (Q4591328) (← links)
- (Q4591345) (← links)
- On 132-representable Graphs (Q4595641) (← links)
