Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Packing cliques in 3‐uniform hypergraphs: Label: en
  2. On determining when small embeddings of partial Steiner triple systems exist: Label: en
  3. An improved recursive construction for disjoint Steiner quadruple systems: Label: en
  4. Short k‐radius sequences, k‐difference sequences and universal cycles: Label: en
  5. Quasigroups constructed from perfect Mendelsohn designs with block size 4: Label: en
  6. The existence of disjoint (hooked) near‐Rosa sequences and applications: Label: en
  7. Design theory and some forbidden configurations: Label: en
  8. Large monochromatic components in 3‐edge‐colored Steiner triple systems: Label: en
  9. Classification of skew‐Hadamard matrices of order 32 and association schemes of order 31: Label: en
  10. Q5‐factorization of λKn: Label: en
  11. The existence of large set of symmetric partitioned incomplete latin squares: Label: en
  12. A complete solution to the infinite Oberwolfach problem: Label: en
  13. All group‐based latin squares possess near transversals: Label: en
  14. Some results on the Ryser design conjecture: Label: en
  15. Dual incidences and t‐designs in vector spaces: Label: en
  16. Orthogonal cycle systems with cycle length less than 10: Label: en
  17. Completing the solution of the directed Oberwolfach problem with cycles of equal length: Label: en
  18. Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods: Label: en
  19. On the chromatic number of some generalized Kneser graphs: Label: en
  20. The maximum number of columns in E(s2) $\,E({s}^{2})$‐optimal supersaturated designs with 16 rows and smax=4 ${s}_{{\rm{\max }}}=4$ is 60: Label: en
  21. Euclidean designs obtained from spherical embedding of coherent configurations: Label: en
  22. An alternative construction of the Hermitian unital 2‐(28, 4, 1) design: Label: en
  23. Weak sequenceability in cyclic groups: Label: en
  24. Tight globally simple nonzero sum Heffter arrays and biembeddings: Label: en
  25. The existence of irrational most perfect magic squares: Label: en
  26. Partial geometric designs having circulant concurrence matrices: Label: en
  27. Partial orthomorphisms and Latin squares based on parts of a group: Label: en
  28. On intriguing sets in five classes of strongly regular graphs: Label: en
  29. Group divisible designs with block size 4 and group sizes 2 and 5: Label: en
  30. Perfect and nearly perfect separation dimension of complete and random graphs: Label: en
  31. On optimal (Z6m×Z6n,4,1) and (Z2m×Z18n,4,1) difference packings and their related codes: Label: en
  32. An extension of a construction of covering arrays: Label: en
  33. Legendre G‐array pairs and the theoretical unification of several G‐array families: Label: en
  34. Partitionable sets, almost partitionable sets, and their applications: Label: en
  35. On split graphs with three or four distinct (normalized) Laplacian eigenvalues: Label: en
  36. Intersecting and 2‐intersecting hypergraphs with maximal covering number: The Erdős–Lovász theme revisited: Label: en
  37. The localization number of designs: Label: en
  38. Graph decompositions in projective geometries: Label: en
  39. Quaternary complex Hadamard matrices of order 18: Label: en
  40. Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length: Label: en
  41. Anti‐Pasch optimal coverings with triples: Label: en
  42. Sparse Steiner triple systems of order 21: Label: en
  43. Pure tetrahedral quadruple systems with index two: Label: en
  44. Restrictions on parameters of partial difference sets in nonabelian groups: Label: en
  45. A reduction of the spectrum problem for odd sun systems and the prime case: Label: en
  46. Further results on large sets of partitioned incomplete Latin squares: Label: en
  47. Corrigendum: Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2: Label: en
  48. Colouring problems for symmetric configurations with block size 3: Label: en
  49. Perfect 2‐colorings of Hamming graphs: Label: en
  50. Block‐avoiding point sequencings: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)