The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Identifying codes of Cartesian product of two cliques of the same size (Q1010656) (← links)
- A natural series for the natural logarithm (Q1010657) (← links)
- Graphs with many copies of a given subgraph (Q1010658) (← links)
- Characterizing cell-decomposable metrics (Q1010659) (← links)
- Convexly independent subsets of the Minkowski sum of planar point sets (Q1010661) (← links)
- Intersecting and cross-intersecting families of labeled sets (Q1010662) (← links)
- A note on the component structure in random intersection graphs with tunable clustering (Q1010663) (← links)
- Lattice points in Minkowski sums (Q1010664) (← links)
- A combinatorial proof of Andrews' smallest parts partition function (Q1010666) (← links)
- The maximum number of perfect matchings in graphs with a given degree sequence (Q1010667) (← links)
- How long can a graph be kept planar? (Q1010669) (← links)
- An identity generator: basic commutators (Q1010670) (← links)
- Necklace bisection with one cut less than needed (Q1010671) (← links)
- Induced paths in twin-free graphs (Q1010672) (← links)
- A note on palindromic delta-vectors for certain rational polytopes (Q1010674) (← links)
- A note about Bezdek's conjecture on covering an annulus by strips (Q1010675) (← links)
- Bijective proofs of identities from colored binary trees (Q1010676) (← links)
- Generalized descents and normality (Q1010677) (← links)
- A note on polynomials and \(f\)-factors of graphs (Q1010679) (← links)
- A sharp bound for the reconstruction of partitions (Q1010680) (← links)
- Unextendible sequences in finite abelian groups (Q1010681) (← links)
- Partitions and edge colourings of multigraphs (Q1010682) (← links)
- Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs (Q1010683) (← links)
- On the diameter of matroid ports (Q1010684) (← links)
- The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph (Q1010685) (← links)
- Evaluation of a multiple integral of Tefera via properties of the exponential distribution (Q1010686) (← links)
- On base partitions and cover partitions of skew characters (Q1010687) (← links)
- Coupon collecting with quotas (Q1010689) (← links)
- On the number of orthogonal systems in vector spaces over finite fields (Q1010690) (← links)
- An extremal doubly even self-dual code of length 112 (Q1010691) (← links)
- For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) (Q1010692) (← links)
- A note on neighbour-distinguishing regular graphs total-weighting (Q1010694) (← links)
- Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs (Q1010695) (← links)
- On the non-existence of certain hyperovals in dual André planes of order 2\(^{2h}\) (Q1010696) (← links)
- On domination in 2-connected cubic graphs (Q1010698) (← links)
- A note on \(K_{k,k}\)-cross free families (Q1010699) (← links)
- Quantitative sum product estimates on different sets (Q1010700) (← links)
- Bordered conjugates of words over large alphabets (Q1010701) (← links)
- A pairing strategy for tic-tac-toe on the integer lattice with numerous directions (Q1010703) (← links)
- A counterexample to a conjecture of Erdős, Graham and Spencer (Q1010704) (← links)
- On 3-harness weaving: cataloging designs generated by fundamental blocks having distinct rows and columns (Q1010706) (← links)
- Automated proofs for some Stirling number identities (Q1010707) (← links)
- On identifying codes in the King grid that are robust against edge deletions (Q1010708) (← links)
- The minor crossing number of graphs with an excluded minor (Q1010709) (← links)
- Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces (Q1010710) (← links)
- Almost product evaluation of Hankel determinants (Q1010711) (← links)
- Osculating paths and oscillating tableaux (Q1010712) (← links)
- Constructing fifteen infinite classes of nonregular bipartite integral graphs (Q1010713) (← links)
- Vector spaces and the Petersen graph (Q1010714) (← links)
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions (Q1010715) (← links)
