The following pages link to review text (P1448):
Displaying 50 items.
- Some new binomial sums related to the Catalan triangle (Q405119) (← links)
- On a conjecture concerning the Petersen graph. II (Q405121) (← links)
- About half permutations (Q405123) (← links)
- Self-dual spherical grids (Q405124) (← links)
- The Goldman-Rota identity and the Grassmann scheme (Q405125) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Schur times Schubert via the Fomin-Kirillov algebra (Q405127) (← links)
- A set and collection lemma (Q405128) (← links)
- Crossings in grid drawings (Q405129) (← links)
- Extremal problems for subset divisors (Q405131) (← links)
- Polynomial sequences of binomial-type arising in graph theory (Q405133) (← links)
- The unreasonable ubiquitousness of quasi-polynomials (Q405135) (← links)
- On the number of spanning trees in random regular graphs (Q405137) (← links)
- Rainbow path and color degree in edge colored graphs (Q405138) (← links)
- The gap structure of a family of integer subsets (Q405142) (← links)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem (Q405143) (← links)
- Nested recursions, simultaneous parameters and tree superpositions (Q405147) (← links)
- Logarithmic tree-numbers for acyclic complexes (Q405148) (← links)
- A generalization of Aztec diamond theorem. I (Q405149) (← links)
- On the number of orientations of random graphs with no directed cycles of a given length (Q405150) (← links)
- Non-normal very ample polytopes and their holes (Q405151) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Edge-decomposition of graphs into copies of a tree with four edges (Q405153) (← links)
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← links)
- Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
- Non-existence of point-transitive \(2\)-\((106, 6, 1)\) designs (Q405161) (← links)
- Equipopularity classes of 132-avoiding permutations (Q405164) (← links)
- Semiarcs with long secants (Q405165) (← links)
- Minimal crystallizations of 3-manifolds (Q405166) (← links)
- Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
- The proof of the removable pair conjecture for fractional dimension. (Q405169) (← links)
- Online Ramsey theory for planar graphs (Q405170) (← links)
- Convolution identities for Bernoulli and Genocchi polynomials (Q405172) (← links)
- Certificates for properties of stability polynomials of graphs (Q405176) (← links)
- A group action on derangements (Q405178) (← links)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- Monomial ideals with primary components given by powers of monomial prime ideals (Q405181) (← links)
- Counting words with Laguerre series (Q405183) (← links)
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture (Q405184) (← links)
- Some new characterizations of graph colorability and of blocking sets of projective spaces (Q405185) (← links)
- Counting symmetric nilpotent matrices (Q405186) (← links)
- Degree Ramsey numbers of closed blowups of trees (Q405189) (← links)
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- A simple formula for the series of constellations and quasi-constellations with boundaries (Q405195) (← links)
- Signed excedance enumeration in the hyperoctahedral group (Q405196) (← links)
- On the Möbius function of permutations with one descent (Q405198) (← links)
- Progress on Dirac's conjecture (Q405200) (← links)
- Matching covered graphs with three removable classes (Q405203) (← links)
