The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Characterization of \([1,k]\)-bar visibility trees (Q870007) (← links)
- Weighted zeta functions of graph coverings (Q870008) (← links)
- Edge-magic group labellings of countable graphs (Q870009) (← links)
- Restricted walks in regular trees (Q870011) (← links)
- Nilpotent Singer groups. (Q870012) (← links)
- Perfect matching preservers (Q870013) (← links)
- Parity versions of 2-connectedness (Q870015) (← links)
- Total 4-choosability of series-parallel graphs (Q870016) (← links)
- Edge and total choosability of near-outerplanar graphs (Q870017) (← links)
- A quantitative ergodic theory proof of Szemerédi's theorem (Q870018) (← links)
- Shift equivalence of P-finite sequences (Q870019) (← links)
- From well-quasi-ordered sets to better-quasi-ordered sets (Q870020) (← links)
- On a balanced property of derangements (Q870021) (← links)
- A hybrid of Darboux's method and singularity analysis in combinatorial asymptotics (Q870022) (← links)
- Movable \((n_4)\) configurations (Q870023) (← links)
- On lengths of rainbow cycles (Q870025) (← links)
- Hayman admissible functions in several variables (Q870027) (← links)
- Cycle lengths in a permutation are typically Poisson (Q870028) (← links)
- A combinatorial derivation of the PASEP stationary state (Q870031) (← links)
- Constructions of representations of rank two semisimple Lie algebras with distributive lattices (Q870035) (← links)
- Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns (Q870036) (← links)
- Permutations, cycles and the pattern 2--13 (Q870037) (← links)
- Matchings avoiding partial patterns (Q870038) (← links)
- On an identity for the cycle indices of rooted tree automorphism groups (Q870039) (← links)
- An Ehrhart series formula for reflexive polytopes (Q870040) (← links)
- On the proof of a theorem of Pálfy. (Q870041) (← links)
- The induced subgraph order on unlabelled graphs (Q870042) (← links)
- BG-ranks and 2-cores (Q870043) (← links)
- Parameter augmentation for two formulas (Q870045) (← links)
- The circular chromatic index of flower snarks (Q870047) (← links)
- On the symmetry of the distribution of \(k\)-crossings and \(k\)-nestings in graphs (Q870048) (← links)
- A note on exponents vs root heights for complex simple Lie algebras (Q870049) (← links)
- Erdős-Ko-Rado-type theorems for colored sets (Q870050) (← links)
- The initial involution patterns of permutations (Q870051) (← links)
- Recognizing cluster algebras of finite type (Q870052) (← links)
- A characterization for sparse \(\varepsilon\)-regular pairs (Q870053) (← links)
- Bipartite-uniform hypermaps on the sphere (Q870054) (← links)
- A new method to construct lower bounds for van der Waerden numbers (Q870059) (← links)
- Gray-ordered binary necklaces (Q870062) (← links)
- Nonabelian groups with \((96,20,4)\) difference sets (Q870064) (← links)
- Bijective counting of tree-rooted maps and shuffles of parenthesis systems (Q870065) (← links)
- Clusters in a multigraph with elevated density (Q870066) (← links)
- Permutations without long decreasing subsequences and random matrices (Q870067) (← links)
- On the genus distribution of \((p,q,n)\)-dipoles (Q870070) (← links)
- Coloured generalised Young diagrams for affine Weyl-Coxeter groups (Q870072) (← links)
- Revisiting two classical results on graph spectra (Q870073) (← links)
- Combinatorial interpretations for rank-two cluster algebras of affine type. (Q870074) (← links)
- Structural properties of twin-free graphs (Q870075) (← links)
- Component evolution in random intersection graphs (Q870077) (← links)
- Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6 (Q870078) (← links)
