The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Identifying vertex covers in graphs (Q1953340) (← links)
- Structure of colored complete graphs free of proper cycles (Q1953342) (← links)
- Some convolution identities and an inverse relation involving partial Bell polynomials (Q1953343) (← links)
- The (signless Laplacian) spectral radii of connected graphs with prescribed degree sequences (Q1953344) (← links)
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10 (Q1953345) (← links)
- The hitting time of rainbow connection number two (Q1953346) (← links)
- A proof of Erdős-Fishburn's conjecture for \(g(6)=13\) (Q1953348) (← links)
- Combinatorial expansions in \(K\)-theoretic bases (Q1953349) (← links)
- Münchhausen matrices (Q1953350) (← links)
- Counting bases of representable matroids (Q1953352) (← links)
- Hopf algebra of building sets. (Q1953353) (← links)
- An ordered Turán problem for bipartite graphs (Q1953354) (← links)
- Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs (Q1953356) (← links)
- \(\Gamma \)-species and the enumeration of \(k\)-trees (Q1953357) (← links)
- The tau constant and the edge connectivity of a metrized graph (Q1953358) (← links)
- Three color Ramsey numbers for graphs with at most 4 vertices (Q1953359) (← links)
- Further analysis on the total number of subtrees of trees (Q1953360) (← links)
- On cross-intersecting families of set partitions (Q1953361) (← links)
- List-coloring graphs on surfaces with varying list-sizes (Q1953362) (← links)
- On the spanning trees of the hypercube and other products of graphs (Q1953363) (← links)
- On the number of partition weights with Kostka multiplicity one (Q1953366) (← links)
- Connectivity for random graphs from a weighted bridge-addable class (Q1953367) (← links)
- The number of ways to assemble a graph (Q1953368) (← links)
- Generalized Alcuin's sequence (Q1953369) (← links)
- Identifying codes of lexicographic product of graphs (Q1953370) (← links)
- Distance-regular graphs with a relatively small eigenvalue multiplicity (Q1953371) (← links)
- Ramsey properties of permutations (Q1953372) (← links)
- T-systems with boundaries from network solutions (Q1953373) (← links)
- Hom complexes of set systems (Q1953374) (← links)
- Forbidden submatrices: some new bounds and constructions (Q1953376) (← links)
- Covering \(n\)-permutations with \((n+1)\)-permutations (Q1953379) (← links)
- Statistical distributions and \(q\)-analogues of \(k\)-Fibonacci numbers (Q1953382) (← links)
- Pattern popularity in 132-avoiding permutations (Q1953384) (← links)
- Products and sums divisible by central binomial coefficients (Q1953385) (← links)
- Colourful theorems and indices of homomorphism complexes (Q1953386) (← links)
- A family of two-variable derivative polynomials for tangent and secant (Q1953387) (← links)
- The Ramsey number of loose paths in 3-uniform hypergraphs (Q1953390) (← links)
- The maximal number of runs in standard Sturmian words (Q1953392) (← links)
- On the Sprague-Grundy values of the \(\mathcal{F}\)-Wythoff game (Q1953393) (← links)
- Scattered linear sets and pseudoreguli (Q1953394) (← links)
- Towards random uniform sampling of bipartite graphs with given degree sequence (Q1953395) (← links)
- Cross-intersecting families of labeled sets (Q1953396) (← links)
- Monochromatic path and cycle partitions in hypergraphs (Q1953397) (← links)
- Graphs with large distinguishing chromatic number (Q1953399) (← links)
- The Canada day theorem (Q1953401) (← links)
- Nonconvexity of the set of hypergraph degree sequences (Q1953402) (← links)
- The prime stems of rooted circuits of closure spaces and minimum implicational bases (Q1953403) (← links)
- The distinguishing chromatic number of Kneser graphs (Q1953404) (← links)
- On a class of highly symmetric \(k\)-factorizations (Q1953405) (← links)
- Finding a princess in a palace: a pursuit-evasion problem (Q1953406) (← links)
