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 #351 to #400.

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

  1. On basis diagraphs: Label: en
  2. Extrema concerning asymmetric graphs: Label: en
  3. A coarseness conjecture of Erdös: Label: en
  4. Upper bounds for some Ramsey numbers: Label: en
  5. On the 1-factors of a non-separable graph: Label: en
  6. Characterization of line graphs: Label: en
  7. Two theorems on the minimum number of intersections for complete graphs: Label: en
  8. Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation: Label: en
  9. An exponential formula for solving Boltzmann's equation for a Maxwellian gas: Label: en
  10. On some possibilities of generalizing the Lorentz group in the special relativity theory: Label: en
  11. On a combinatorial conjecture of Erdös: Label: en
  12. The number of faces of simplicial polytopes: Label: en
  13. A characterization of planar geodetic graphs: Label: en
  14. Kronecker products of fully indecomposable matrices and of ultrastrong digraphs: Label: en
  15. On the inequality Σxiyi ≥ 1/nΣxi·Σyi and the van der Waerden permanent conjecture: Label: en
  16. Some inequalities for combinatorial matrix functions: Label: en
  17. A note on plane trees: Label: en
  18. Note on the number of finite algebras: Label: en
  19. The Möbius function of a lattice: Label: en
  20. On dichromatic polynomials: Label: en
  21. Parity patterns on even triangulated polygons: Label: en
  22. On comparing connecting networks: Label: en
  23. A mathematical investigation of games of “take-away”: Label: en
  24. The power group enumeration theorem: Label: en
  25. On subsets containing a family of non-commensurable subsets of a finite set: Label: en
  26. On separating systems of a finite set: Label: en
  27. On partitions of a finite set: Label: en
  28. On the disproof of spectral synthesis: Label: en
  29. An identity of the jacobi type for pfaffians: Label: en
  30. A combinatorial proof of Cayley's theorem on Pfaffians: Label: en
  31. Evaluation of a class of binomial coefficient summations: Label: en
  32. Permutations with limited repetitions: Label: en
  33. Tiling with polyominoes: Label: en
  34. On the construction of block designs: Label: en
  35. On the construction of certain graphs: Label: en
  36. A necessary condition for four-coloring a planar graph: Label: en
  37. Graphes Planaires homogènes de degré 3: Label: en
  38. On the order of the group of a planar map: Label: en
  39. A note on some graphs related to knots: Label: en
  40. Graphs and composite games: Label: en
  41. Hall subgroups of the symmetric groups: Label: en
  42. On the algebraic theory of graph colorings: Label: en
  43. A packing problem for parallelepipeds: Label: en
  44. Families of Non-disjoint subsets: Label: en
  45. On hearing the shape of a drum: Label: en
  46. On the number of certain lattice polygons: Label: en
  47. A note on the arithmetic structure of the integers modulo N: Label: en
  48. More birthday surprises: Label: en
  49. N(4, 4; 3)≥13: Label: en
  50. Tiling with sets of polyominoes: Label: en

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