The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
- Non-existence of point-transitive \(2\)-\((106, 6, 1)\) designs (Q405161) (← links)
- Equipopularity classes of 132-avoiding permutations (Q405164) (← links)
- Semiarcs with long secants (Q405165) (← links)
- Minimal crystallizations of 3-manifolds (Q405166) (← links)
- Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
- The proof of the removable pair conjecture for fractional dimension. (Q405169) (← links)
- Online Ramsey theory for planar graphs (Q405170) (← links)
- Convolution identities for Bernoulli and Genocchi polynomials (Q405172) (← links)
- Certificates for properties of stability polynomials of graphs (Q405176) (← links)
- A group action on derangements (Q405178) (← links)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- Monomial ideals with primary components given by powers of monomial prime ideals (Q405181) (← links)
- Counting words with Laguerre series (Q405183) (← links)
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture (Q405184) (← links)
- Some new characterizations of graph colorability and of blocking sets of projective spaces (Q405185) (← links)
- Counting symmetric nilpotent matrices (Q405186) (← links)
- Degree Ramsey numbers of closed blowups of trees (Q405189) (← links)
- Totally symmetric functions are reconstructible from identification minors (Q405190) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- A simple formula for the series of constellations and quasi-constellations with boundaries (Q405195) (← links)
- Signed excedance enumeration in the hyperoctahedral group (Q405196) (← links)
- On the Möbius function of permutations with one descent (Q405198) (← links)
- Progress on Dirac's conjecture (Q405200) (← links)
- Matching covered graphs with three removable classes (Q405203) (← links)
- Matroid and Tutte-connectivity in infinite graphs (Q405204) (← links)
- Tree reconstruction from triplet cover distances (Q405205) (← links)
- The Ihara zeta function of the infinite grid (Q405206) (← links)
- Zero-sum magic labelings and null sets of regular graphs (Q405209) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Colour-blind can distinguish colour pallets (Q405211) (← links)
- Bruhat order on fixed-point-free involutions in the symmetric group (Q405213) (← links)
- The parity of a thicket (Q405214) (← links)
- New Ramsey classes from old (Q405215) (← links)
- A note on coloring line arrangements (Q405217) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- The combinatorics of \(\mathsf{A}_2\)-webs (Q405220) (← links)
- The topology of competitively constructed graphs (Q405221) (← links)
- A combinatorial identity of multiple zeta values with even arguments (Q405223) (← links)
- On a general \(q\)-identity (Q405224) (← links)
- On the group of alternating colored permutations. (Q405226) (← links)
- On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs (Q405227) (← links)
- A pseudoline counterexample to the strong Dirac conjecture (Q405230) (← links)
- Combinatorial study of Dellac configurations and \(q\)-extended normalized median Genocchi numbers (Q405232) (← links)
- A note on covering edge colored hypergraphs by monochromatic components (Q405234) (← links)
- The extendability of matchings in strongly regular graphs (Q405235) (← links)
- Hyperoctahedral Eulerian idempotents, Hodge decompositions, and signed graph coloring complexes (Q405237) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
- An elementary proof of Jin's theorem with a bound (Q405240) (← links)
