The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Doubly slice knots with low crossing number (Q887801) (← links)
- Linear transformations preserving the strong \(q\)-log-convexity of polynomials (Q888580) (← links)
- Connectivity of some algebraically defined digraphs (Q888582) (← links)
- Weight of 3-paths in sparse plane graphs (Q888584) (← links)
- On the game domination number of graphs with given minimum degree (Q888585) (← links)
- The covering problem in Rosenbloom-Tsfasman spaces (Q888588) (← links)
- Covering partial cubes with zones (Q888589) (← links)
- Semiregular automorphisms of cubic vertex-transitive graphs and the abelian normal quotient method (Q888590) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- Regular graphs are antimagic (Q888592) (← links)
- Bessenrodt-Stanley polynomials and the octahedron recurrence (Q888593) (← links)
- Locally oriented noncrossing trees (Q888594) (← links)
- Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers (Q888595) (← links)
- Vizing's conjecture for graphs with domination number 3 -- a new proof (Q888596) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- Iterative properties of birational rowmotion. II: Rectangles and triangles. (Q888599) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- A remark on the tournament game (Q888601) (← links)
- Genus ranges of 4-regular rigid vertex graphs (Q888603) (← links)
- The spectrum for 3-way \(k\)-homogeneous Latin trades (Q888605) (← links)
- Genus of the Cartesian product of triangles (Q888606) (← links)
- An exact Turán result for tripartite 3-graphs (Q888608) (← links)
- The Page-Rényi parking process (Q888609) (← links)
- Bounding tree-width via contraction on the projective plane and torus (Q888611) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- A generalization of Graham's conjecture (Q888614) (← links)
- HOMFLY polynomials of torus links as generalized Fibonacci polynomials (Q888616) (← links)
- Random-player maker-breaker games (Q888617) (← links)
- Walks, partitions, and normal ordering (Q888618) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations (Q888620) (← links)
- Wilf-classification of mesh patterns of short length (Q888626) (← links)
- Thin edges in braces (Q888627) (← links)
- The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
- Overview on Heisenberg-Weyl algebra and subsets of Riordan subgroups (Q888630) (← links)
- Rank and crank analogs for some colored partitions (Q888631) (← links)
- \(h\)-polynomials via reduced forms (Q888633) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
- Reconstructing permutations from identification minors (Q888635) (← links)
- Normally regular digraphs (Q888636) (← links)
- Enumeration of Lozenge tilings of halved hexagons with a boundary defect (Q888637) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Cataloguing PL 4-manifolds by gem-complexity (Q895059) (← links)
- A linear bound towards the traceability conjecture (Q895060) (← links)
- On generalizations of the Petersen graph and the Coxeter graph (Q895061) (← links)
- Inversion formulae on permutations avoiding 321 (Q895062) (← links)
- Okounkov's BC-type interpolation Macdonald polynomials and their \(q=1\) limit (Q896776) (← links)
- Comparing estimates on the number of zeros of irreducible characters in symmetric groups. (Q896778) (← links)
- Incidence Hopf algebra of the hypertree posets (Q896779) (← links)
