The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- On 021-avoiding ascent sequences (Q1953473) (← links)
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile (Q1953475) (← links)
- Asymptotic lower bounds on circular chromatic index of snarks (Q1953476) (← links)
- Maximal antichains of minimum size (Q1953477) (← links)
- Coloring the cube with rainbow cycles (Q1953479) (← links)
- Pattern avoidance in matchings and partitions (Q1953480) (← links)
- Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group (Q1953481) (← links)
- Erdős-Gyárfás conjecture for cubic planar graphs (Q1953482) (← links)
- Counting families of mutually intersecting sets (Q1953483) (← links)
- The biased odd cycle game (Q1953485) (← links)
- Decomposition of triply rooted trees (Q1953487) (← links)
- A simple proof of an identity of Lacasse (Q1953488) (← links)
- Sisterhood in the Gale-Shapley matching algorithm (Q1953489) (← links)
- A combinatorial proof of an identity for the divisor generating function (Q1953490) (← links)
- Non-classical hyperplanes of \(\mathrm{DW}(5,q)\) (Q1953491) (← links)
- General lower bounds on maximal determinants of binary matrices (Q1953493) (← links)
- On optimality of designs with three distinct eigenvalues (Q1953495) (← links)
- New results in \(t\)-tone coloring of graphs (Q1953497) (← links)
- An inductive approach to constructing universal cycles on the \(k\)-subsets of \([n]\) (Q1953498) (← links)
- On the skew spectra of Cartesian products of graphs (Q1953501) (← links)
- Minimal covers of the Archimedean tilings. II. (Q1953502) (← links)
- On the Cartesian product of non well-covered graphs (Q1953503) (← links)
- Circular Nim games (Q1953504) (← links)
- Random lifts of graphs are highly connected (Q1953505) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- Hamilton saturated hypergraphs of essentially minimum size (Q1953507) (← links)
- Fixed point polynomials of permutation groups. (Q1953509) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- Excedance numbers for the permutations of type \(B\) (Q1953513) (← links)
- Congruences for \(q\)-Lucas numbers (Q1953514) (← links)
- On the rank of \(p\)-schemes (Q1953516) (← links)
- Labeling the regions of the type \(C_n\) Shi arrangement (Q1953517) (← links)
- Face numbers of centrally symmetric polytopes produced from Split graphs (Q1953519) (← links)
- Coupon collector problem for non-uniform coupons and random quotas (Q1953522) (← links)
- An extension theorem for terraces. (Q1953523) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Near packings of graphs (Q1953525) (← links)
- On the number of nonequivalent propelinear extended perfect codes (Q1953526) (← links)
- The number of rooted trees of given depth (Q1953527) (← links)
- Affine primitive groups and semisymmetric graphs (Q1953528) (← links)
- On blow-ups and injectivity of quivers (Q1953529) (← links)
- Multivariate Fuss-Narayana polynomials and their application to random matrices (Q1953531) (← links)
- Integer points in knapsack polytopes and \(s\)-covering radius (Q1953532) (← links)
- Which exterior powers are balanced? (Q1953535) (← links)
- Generating and enumerating 321-avoiding and skew-merged simple permutations (Q1953536) (← links)
- Cores of vertex transitive graphs (Q1953537) (← links)
- A survey of forbidden configuration results (Q1953538) (← links)
- The graph crossing number and its variants: a survey (Q1953539) (← links)
- A new approach to the Dyson coefficients (Q1960264) (← links)
- On Stanley's partition function (Q1960265) (← links)
