The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Modular Schur numbers (Q396788) (← links)
- On the Turán number of forests (Q396789) (← links)
- Integral Cayley multigraphs over abelian and Hamiltonian groups (Q396792) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- Maximum planar subgraphs in dense graphs (Q396794) (← links)
- Gromov hyperbolicity in strong product graphs (Q396796) (← links)
- Degree distribution of an inhomogeneous random intersection graph (Q396797) (← links)
- Limits of modified higher \(q,t\)-Catalan numbers (Q396799) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- A bound on permutation codes (Q396801) (← links)
- An identity conjectured by Lacasse via the tree function (Q396802) (← links)
- \((2,m,n)\)-groups with Euler characteristic equal to \(-2^as^b\). (Q396803) (← links)
- Geometric constructions for symmetric 3-configurations (Q396804) (← links)
- On the independence numbers of the cubes of odd cycles (Q396806) (← links)
- Extensions to 2-factors in bipartite graphs (Q396808) (← links)
- A plethysm formula on the characteristic map of induced linear characters from \(U_n(\mathbb F_q)\) to \(GL(\mathbb F_q)\). (Q396810) (← links)
- The number of Euler tours of random directed graphs (Q396813) (← links)
- Generalized permutohedra, \(h\)-vectors of cotransversal matroids and pure \(O\)-sequences (Q396815) (← links)
- Balanced vertex decomposable simplicial complexes and their \(h\)-vectors (Q396818) (← links)
- Symmetry in Gardens of Eden (Q396822) (← links)
- Eigenvalue pairing in the response matrix for a class of network models with circular symmetry (Q396824) (← links)
- A characterization of graphs by codes from their incidence matrices (Q396825) (← links)
- An inhomogeneous lambda-determinant (Q396827) (← links)
- Regularity of join-meet ideals of distributive lattices (Q396829) (← links)
- The spectral excess theorem for distance-biregular graphs. (Q396831) (← links)
- The combinatorics of interval vector polytopes (Q396835) (← links)
- Can colour-blind distinguish colour palettes? (Q396838) (← links)
- Embedding cycles in finite planes (Q396840) (← links)
- A note on total and paired domination of Cartesian product graphs (Q396841) (← links)
- The edit distance function and symmetrization (Q396842) (← links)
- The adjacency matroid of a graph (Q396844) (← links)
- Greedy trees, subtrees and antichains (Q396846) (← links)
- Medial symmetry type graphs (Q396849) (← links)
- On sumsets of multisets in \(\mathbb{Z}_p^m\) (Q396850) (← links)
- Knots in collapsible and non-collapsible balls (Q396852) (← links)
- Upper-bounding the \(k\)-colorability threshold by counting covers (Q396853) (← links)
- Involutions on standard Young tableaux and divisors on metric graphs (Q396858) (← links)
- Symmetric polynomials and symmetric mean inequalities (Q396860) (← links)
- Integral circulant Ramanujan graphs of prime power order (Q396862) (← links)
- On the size of Kakeya sets in finite vector spaces (Q396866) (← links)
- Coloring 2-intersecting hypergraphs (Q396868) (← links)
- Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set (Q396872) (← links)
- New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
- On the relationship between pipe dreams and permutation words (Q396875) (← links)
- From heaps of matches to the limits of computability (Q396877) (← links)
- Product dimension of forests and bounded treewidth graphs (Q396879) (← links)
- Enumerating finite racks, quandles and kei (Q396881) (← links)
- Shattering, graph orientations, and connectivity (Q396883) (← links)
- Delay colourings of cubic graphs (Q396884) (← links)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
