The following pages link to Advances in Combinatorics (Q2846951):
Displayed 46 items.
- Glaisher’s Formulas for $${\frac{1} {{\pi }^{2}}}$$ and Some Generalizations (Q2846952) (← links)
- Complementary Bell Numbers: Arithmetical Properties and Wilf’s Conjecture (Q2846953) (← links)
- Partitions with Early Conditions (Q2846954) (← links)
- Hypergeometric Identities Associated with Statistics on Words (Q2846955) (← links)
- Stationary Distribution and Eigenvalues for a de Bruijn Process (Q2846956) (← links)
- Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes (Q2846957) (← links)
- Watson–Like Formulae for Terminating 3 F 2-Series (Q2846958) (← links)
- Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf (Q2846959) (← links)
- Beating Your Fractional Beatty Game Opponent and: What’s the Question to Your Answer? (Q2846960) (← links)
- WZ-Proofs of “Divergent” Ramanujan-Type Series (Q2846961) (← links)
- Smallest Parts in Compositions (Q2846962) (← links)
- Cyclic Sieving for Generalised Non-crossing Partitions Associated with Complex Reflection Groups of Exceptional Type (Q2846963) (← links)
- Set Partitions with No m-Nesting (Q2846964) (← links)
- The Distribution of Zeros of the Derivative of a Random Polynomial (Q2846965) (← links)
- On the Distribution of Small Denominators in the Farey Series of Order N (Q2846966) (← links)
- Lost in Translation (Q2846967) (← links)
- Exact stability for Turán’s Theorem (Q5028504) (← links)
- The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction (Q5126747) (← links)
- A tight Erdős-Pósa function for planar minors (Q5126748) (← links)
- The Ramsey number of books (Q5126749) (← links)
- Upper density of monochromatic infinite paths (Q5126750) (← links)
- A 4-choosable graph that is not (8:2)-choosable (Q5126751) (← links)
- Tight paths in convex geometric hypergraphs (Q5126752) (← links)
- A rainbow version of Mantel's Theorem (Q5126753) (← links)
- Improved bounds for the Erdős-Rogers function (Q5126754) (← links)
- A completion of the proof of the Edge-statistics Conjecture (Q5126755) (← links)
- Planar graphs have bounded nonrepetitive chromatic number (Q5126756) (← links)
- The Bandwidth Theorem in sparse graphs (Q5126757) (← links)
- Large independent sets in triangle-free cubic graphs: beyond planarity (Q5126758) (← links)
- Graphs of bounded cliquewidth are polynomially $χ$-bounded (Q5126760) (← links)
- Tangles are Decided by Weighted Vertex Sets (Q5126761) (← links)
- The maximum number of triangles in a graph of given maximum degree (Q5126762) (← links)
- Unitary signings and induced subgraphs of Cayley graphs of $\mathbb{Z}_2^{n}$ (Q5144437) (← links)
- An aperiodic set of 11 Wang tiles (Q5162865) (← links)
- On Partitioning the Edges of an Infinite Digraph into Directed Cycles (Q5162866) (← links)
- Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics (Q5162867) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)
- The size-Ramsey number of 3-uniform tight paths (Q5162869) (← links)
- Anticoncentration versus the Number of Subset Sums (Q5162870) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Improved Bounds for Centered Colorings (Q5162872) (← links)
- Extremal functions for sparse minors (Q5871274) (← links)
- Leaper Tours (Q5871276) (← links)
- Transversal factors and spanning trees (Q5871277) (← links)
- The number of partial Steiner systems and d-partitions (Q5871278) (← links)
- Asymptotic Enumeration of Hypergraphs by Degree Sequence (Q5871279) (← links)