The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Envy-free cake divisions cannot be found by finite protocols (Q1010716) (← links)
- Avoiding rainbow induced subgraphs in vertex-colorings (Q1010717) (← links)
- Symmetric simplicial pseudoline arrangements (Q1010718) (← links)
- Shifted set families, degree sequences, and plethysm (Q1010720) (← links)
- Transversal lattices (Q1010721) (← links)
- Computing parametric rational generating functions with a primal Barvinok algorithm (Q1010722) (← links)
- \(q\)-Eulerian polynomials and polynomials with only real zeros (Q1010723) (← links)
- Maximal nontraceable graphs with toughness less than one (Q1010724) (← links)
- Ear decompositions in combed graphs (Q1010725) (← links)
- Edit distance and its computation (Q1010726) (← links)
- Coefficients of functional compositions often grow smoothly (Q1010727) (← links)
- Spherical F-tilings by triangles and \(r\)-sided regular polygons, \(r \geq 5\) (Q1010728) (← links)
- An inverse matrix formula in the right-quantum algebra (Q1010729) (← links)
- An anti-Ramsey condition on trees (Q1010730) (← links)
- Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers (Q1010731) (← links)
- Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs (Q1010732) (← links)
- The maximum piercing number for some classes of convex sets with the \((4,3)\)-property (Q1010733) (← links)
- Graph-based upper bounds for the probability of the union of events (Q1010734) (← links)
- Dominating sets of random 2-in 2-out directed graphs (Q1010736) (← links)
- Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes (Q1010738) (← links)
- Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected \(P_{3}\)-graphs (Q1010739) (← links)
- On the resilience of long cycles in random graphs (Q1010740) (← links)
- Spanning trees with many leaves and average distance (Q1010741) (← links)
- The 99th Fibonacci identity (Q1010744) (← links)
- Generating function identities for \(\zeta (2n+2)\), \(\zeta (2n+3)\) via the WZ method (Q1010745) (← links)
- Two coefficients of the Dyson product (Q1010746) (← links)
- On a covering problem for equilateral triangles (Q1010747) (← links)
- The combinatorics of the Garsia-Haiman modules for hook shapes (Q1010748) (← links)
- On pattern-avoiding partitions (Q1010749) (← links)
- Small group divisible Steiner quadruple systems (Q1010751) (← links)
- Codes from cubic curves and their extensions (Q1010753) (← links)
- The IC-indices of complete bipartite graphs (Q1010754) (← links)
- Circular chromatic index of generalized Blanuša snarks (Q1010755) (← links)
- An elementary proof of the hook formula (Q1010756) (← links)
- The crossing number of a projective graph is quadratic in the face-width (Q1010759) (← links)
- On the Turán properties of infinite graphs (Q1010760) (← links)
- The lonely runner with seven runners (Q1010762) (← links)
- Chromatic graphs, Ramsey numbers and the flexible atom conjecture (Q1010763) (← links)
- Determining lower bounds for packing densities of non-layered patterns using weighted templates (Q1010765) (← links)
- The map asymptotics constant \(t_{g}\) (Q1010766) (← links)
- A refinement of the formula for \(k\)-ary trees and the Gould-Vandermonde's convolution (Q1010768) (← links)
- Area distribution and scaling function for punctured polygons (Q1010769) (← links)
- A new family of Somos-like recurrences (Q1010771) (← links)
- On the failing cases of the Johnson bound for error-correcting codes (Q1010772) (← links)
- Completing partial Latin squares with two filled rows and two filled columns (Q1010774) (← links)
- On rainbow connection (Q1010776) (← links)
- A quantified version of Bourgain's sum-product estimate in \(\mathbb F_{p}\) for subsets of incomparable sizes (Q1010777) (← links)
- On rainbow trees and cycles (Q1010778) (← links)
- Large holes in quasi-random graphs (Q1010779) (← links)
- Major indices and perfect bases for complex reflection groups. (Q1010780) (← links)
