The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\) (Q2571259) (← links)
- Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs (Q2571260) (← links)
- The combinatorics of orbital varieties closures of nilpotent order 2 in \(\text{sl}_ n\) (Q2571261) (← links)
- Atomic Latin squares based on cyclotomic orthomorphisms (Q2571262) (← links)
- Random orders and gambler's ruin (Q2571263) (← links)
- How different can two intersecting families be? (Q2571264) (← links)
- Wilf classes of pairs of permutations of length 4 (Q2571265) (← links)
- The hook fusion procedure. (Q2571266) (← links)
- Faster algorithms for Frobenius numbers (Q2571269) (← links)
- On the Kronecker product \(s_{(n-p,p)}*s_\lambda\) (Q2571270) (← links)
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums (Q2571271) (← links)
- A triple lacunary generating function for Hermite polynomials (Q2571273) (← links)
- Sorting classes (Q2571274) (← links)
- Lower bound for the size of maximal nontraceable graphs (Q2571275) (← links)
- Long heterochromatic paths in edge-colored graphs (Q2571276) (← links)
- Computing the period of an Ehrhart quasi-polynomial (Q2571277) (← links)
- A determinant identity that implies Rogers-Ramanujan (Q2571278) (← links)
- Indecomposable tilings of the integers with exponentially long periods (Q2571279) (← links)
- Packing unit squares in a rectangle (Q2571280) (← links)
- \(q\)-identities related to overpartitions and divisor functions (Q2571281) (← links)
- Counting segmented permutations using bicoloured Dyck paths (Q2571282) (← links)
- Erdős-Ko-Rado theorems for uniform set-partition systems (Q2571283) (← links)
- Sets in the plane with many concyclic subsets (Q2571284) (← links)
- Steiner triple systems and existentially closed graphs (Q2571285) (← links)
- A solution of two-person single-suit whist (Q2571286) (← links)
- Two-person symmetric whist (Q2571287) (← links)
- A relationship between the major index for tableaux and the charge statistic for permutations (Q2571288) (← links)
- \(\omega\)-periodic graphs (Q2571289) (← links)
- The insertion encoding of permutations (Q2571290) (← links)
- An asymptotic result for the path partition conjecture (Q2571291) (← links)
- Decompositions of graphs into 5-cycles and other small graphs (Q2571292) (← links)
- Minimum common string partition problem: hardness and approximations (Q2571293) (← links)
- Discrepancy games (Q2571294) (← links)
- Longest induced cycles in circulant graphs (Q2571295) (← links)
- The generalized Schröder theory (Q2571296) (← links)
- Bounds for the average \(L^p\)-extreme and the \(L^\infty\)-extreme discrepancy (Q2571297) (← links)
- Packing and covering a unit equilateral triangle with equilateral triangles (Q2571298) (← links)
- Extending arcs: an elementary proof (Q2571299) (← links)
- Integer partitions with fixed subsums (Q2571300) (← links)
- Rank-three matroids are Rayleigh (Q2571301) (← links)
- A Pfaffian-Hafnian analogue of Borchardt's identity (Q2571302) (← links)
- Parity theorems for statistics on domino arrangements (Q2571303) (← links)
- The Turán problem for hypergraphs on fixed size (Q2571304) (← links)
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof (Q2571305) (← links)
- New lower bound for multicolor Ramsey numbers for even cycles (Q2571306) (← links)
- A note on two multicolor Ramsey numbers (Q2571307) (← links)
- A symmetric basis of the algebra of quasi-symmetric coinvariants (Q2571309) (← links)
- The intersection structure of \(t\)-intersecting families (Q2571311) (← links)
- A simple proof for the existence of exponentially balanced Gray codes (Q2571312) (← links)
- A Sperner-type theorem for set-partition systems (Q2571313) (← links)
