The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- On Euclidean designs and potential energy (Q426741) (← links)
- On harmonious colouring of trees (Q426747) (← links)
- On the upper tail of counts of strictly balanced subgraphs (Q426748) (← links)
- Local-to-global principles for the hitting sequence of a rotor walk (Q426751) (← links)
- A basis of finite and infinite sets with small representation function (Q426752) (← links)
- Descents of permutations in a Ferrers board (Q426754) (← links)
- An improved inequality related to Vizing's conjecture (Q426757) (← links)
- The \({1/k}\)-Eulerian polynomials (Q426759) (← links)
- Anti-codes in terms of Berlekamp's switching game (Q426760) (← links)
- Partitions, Kostka polynomials and pairs of trees (Q426762) (← links)
- Kaleidoscopical configurations in \(G\)-spaces (Q426765) (← links)
- Flag \(f\)-vectors of three-colored complexes (Q426766) (← links)
- \(h\)-vectors of small matroid complexes (Q426768) (← links)
- Domination reliability (Q426770) (← links)
- Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials (Q426771) (← links)
- Propagation connectivity of random hypergraphs (Q426773) (← links)
- Pandiagonal sudokus (Q426776) (← links)
- The smallest one-realization of a given set (Q426777) (← links)
- Rainbow connection number and connectivity (Q426778) (← links)
- Generating trees and pattern avoidance in alternating permutations (Q426780) (← links)
- The positive minimum degree game on sparse graphs (Q426781) (← links)
- On Ryser's conjecture (Q426782) (← links)
- A note on random \(k\)-SAT for moderately growing \(k\) (Q426783) (← links)
- On the number of Hamilton cycles in pseudo-random graphs (Q426784) (← links)
- Symmetric chain decomposition of necklace posets (Q426785) (← links)
- Sequences of integers avoiding 3-term arithmetic progressions (Q426786) (← links)
- Actions and identities on set partitions (Q426787) (← links)
- Refined inversion statistics on permutations (Q426790) (← links)
- A construction for the hat problem on a directed graph (Q426792) (← links)
- Susceptibility in inhomogeneous random graphs (Q426793) (← links)
- Bounds for identifying codes in terms of degree parameters (Q426794) (← links)
- Balanced line for a 3-colored point set in the plane (Q426795) (← links)
- The existence of strong complete mappings (Q426796) (← links)
- Automorphism groups of rational circulant graphs (Q426797) (← links)
- The negative \(q\)-binomial (Q426798) (← links)
- Properties of \(\theta\)-super positive graphs (Q426799) (← links)
- Plactic relations for \(r\)-domino tableaux (Q426801) (← links)
- The chromatic number and the least eigenvalue of a graph (Q426804) (← links)
- The identities of additive binary arithmetics (Q426806) (← links)
- On-line list colouring of complete multipartite graphs (Q426807) (← links)
- Efficient oracles for generating binary bubble languages (Q426808) (← links)
- On the number of \(F\)-matchings in a tree (Q426809) (← links)
- Integral sets and Cayley graphs of finite groups (Q426811) (← links)
- Rainbow-free 3-colorings of abelian groups (Q426812) (← links)
- Rainbow Hamilton cycles in uniform hypergraphs (Q426813) (← links)
- Random subgraphs in Cartesian powers of regular graphs (Q426814) (← links)
- The 2-adic valuation of plane partitions and totally symmetric plane partitions (Q426815) (← links)
- On the number of indecomposable permutations with a given number of cycles (Q426818) (← links)
- The covered components polynomial: a new representation of the edge elimination polynomial (Q426819) (← links)
- The effect of random edge removal on network degree sequence (Q426822) (← links)
