The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- A combinatorial bijection on di-sk trees (Q2121740) (← links)
- Automorphisms and some geodesic properties of ortho-Grassmann graphs (Q2121741) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- Periodic solutions of one-dimensional cellular automata with uniformly chosen random rules (Q2121743) (← links)
- Pattern avoidance over a hypergraph (Q2121745) (← links)
- Regarding two conjectures on clique and biclique partitions (Q2121747) (← links)
- Combinatorial game distributions of Steiner systems (Q2121748) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- A combinatorial proof of a Schmidt type theorem of Andrews and Paule (Q2121750) (← links)
- Generalized Dold sequences on partially-ordered sets (Q2121751) (← links)
- Independent sets in subgraphs of a shift graph (Q2121753) (← links)
- Enumeration of Gelfand-Cetlin type reduced words (Q2121754) (← links)
- \(H\)-chromatic symmetric functions (Q2121759) (← links)
- The density of fan-planar graphs (Q2121760) (← links)
- On the dichromatic number of surfaces (Q2121762) (← links)
- Topology of augmented Bergman complexes (Q2121768) (← links)
- The eigenvalues of hyperoctahedral descent operators and applications to card-shuffling (Q2121769) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- Bohr neighborhoods in generalized difference sets (Q2121771) (← links)
- The tree alternative conjecture under the topological minor relation (Q2121772) (← links)
- Some remarks on combinatorial wall-crossing (Q2121773) (← links)
- Andrews-Beck type congruences for overpartitions (Q2121774) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- On pattern avoidance in matchings and involutions (Q2121778) (← links)
- On the connection between Stirling numbers and Bessel numbers (Q2121779) (← links)
- Tiling enumeration of hexagons with off-central holes (Q2121780) (← links)
- Cutting a cake for infinitely many guests (Q2121781) (← links)
- A new family of algebraically defined graphs with small automorphism group (Q2121782) (← links)
- Snarks with resistance \(n\) and flow resistance \(2n\) (Q2121784) (← links)
- Modular and fractional \(L\)-intersecting families of vector spaces (Q2121787) (← links)
- \(K_{r,s}\) graph bootstrap percolation (Q2121788) (← links)
- Edge isoperimetric inequalities for powers of the hypercube (Q2121790) (← links)
- On multisets, interpolated multiple zeta values and limit laws (Q2121791) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- Sharp upper and lower bounds on a restricted class of convex characters (Q2121794) (← links)
- On 1-subdivisions of transitive tournaments (Q2121797) (← links)
- Ramsey numbers of fans and large books (Q2121798) (← links)
- On explicit constructions of designs (Q2121799) (← links)
- Weighted words at degree two. II: Flat partitions, regular partitions, and application to level one perfect crystals (Q2121800) (← links)
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture (Q2121801) (← links)
- On well-connected sets of strings (Q2121802) (← links)
- Treewidth of the generalized Kneser graphs (Q2121803) (← links)
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space (Q2121804) (← links)
- Points and lines configurations for perpendicular bisectors of convex cyclic polygons (Q2121805) (← links)
- Improved bounds for weak coloring numbers (Q2121806) (← links)
- Computing volumes of adjacency polytopes via Draconian sequences (Q2121807) (← links)
- Another note on intervals in the Hales-Jewett theorem (Q2121808) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Nonrepetitive graph colouring (Q2122918) (← links)
