The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- A note on independent sets in graphs with large minimum degree and small cliques (Q405242) (← links)
- On the hyperbolicity of random graphs (Q405243) (← links)
- Enumeration of bipartite graphs and bipartite blocks (Q405245) (← links)
- Bijective proofs of partition identities of Macmahon, Andrews, and Subbarao (Q405247) (← links)
- A bijective proof of Shapiro's Catalan convolution (Q405248) (← links)
- New multiple harmonic sum identities (Q405249) (← links)
- General restriction of \((s,t)\)-Wythoff's game (Q405250) (← links)
- Congruences of finite summations of the coefficients in certain generating functions (Q405253) (← links)
- Split \((n+t)\)-color partitions and Gordon-McIntosh eight order mock theta functions (Q405255) (← links)
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns (Q405257) (← links)
- Random threshold digraphs (Q405260) (← links)
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- Counting 2-connected 4-regular maps on the projective plane (Q405265) (← links)
- Order polynomials and Pólya's enumeration theorem. (Q405267) (← links)
- More on the Wilson \(W_{tk}(v)\) matrices (Q405268) (← links)
- Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun (Q405269) (← links)
- Partitions of \(\mathbb Z_m\) with the same weighted representation functions (Q405271) (← links)
- Lines in higgledy-piggledy arrangement (Q405273) (← links)
- Extremal edge polytopes (Q405274) (← links)
- A spectral equivalent condition of the \(P\)-polynomial property for association schemes (Q405275) (← links)
- Consecutive up-down patterns in up-down permutations (Q405276) (← links)
- A characteristic factor for the 3-term IP Roth theorem in \(\mathbb{Z}_3^\mathbb{N}\) (Q405279) (← links)
- On fence patrolling by mobile agents (Q405281) (← links)
- Arc-transitive dihedral regular covers of cubic graphs (Q405283) (← links)
- Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues (Q405284) (← links)
- The minimum number of nonnegative edges in hypergraphs (Q405286) (← links)
- On the Cayley isomorphism problem for Cayley objects of nilpotent groups of some orders (Q405288) (← links)
- Ascent-descent Young diagrams and pattern avoidance in alternating permutations (Q405289) (← links)
- The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
- A counterexample to a question of Hof, Knill and Simon (Q405294) (← links)
- Counting results for thin Butson matrices (Q405296) (← links)
- Trivial meet and join within the lattice of monotone triangles. (Q405297) (← links)
- On the strong partition dimension of graphs (Q405298) (← links)
- The weak order on pattern-avoiding permutations (Q405300) (← links)
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
- Some identities involving the partial sum of \(q\)-binomial coefficients (Q405302) (← links)
- Minimum-weight edge discriminators in hypergraphs (Q405305) (← links)
- The maximal length of a \(k\)-separator permutation (Q405306) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Extremal problems for the \(p\)-spectral radius of graphs (Q405309) (← links)
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- On the number of colored Birch and Tverberg partitions (Q405313) (← links)
- Bounding sequence extremal functions with formations (Q405315) (← links)
- Counting the palstars (Q405318) (← links)
- A combinatorial proof of the non-vanishing of Hankel determinants of the Thue-Morse sequence (Q406696) (← links)
- Note on the subgraph component polynomial (Q406698) (← links)
- Resolving a conjecture on degree of regularity of linear homogeneous equations (Q406699) (← links)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs (Q406700) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
