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. Degree factors with red-blue coloring of regular graphs: Label: en
  2. Hamiltonian intervals in the lattice of binary paths: Label: en
  3. The critical groups of Adinkras up to 2-rank of Cayley graphs: Label: en
  4. Wreath products and projective system of non-Schurian association schemes: Label: en
  5. Some identities involving \(q\)-Stirling numbers of the second kind in type B: Label: en
  6. A strengthening and an efficient implementation of Alon-Tarsi list coloring method: Label: en
  7. Alon-Boppana-type bounds for weighted graphs: Label: en
  8. Piercing all translates of a set of axis-parallel rectangles: Label: en
  9. A nearly finitary matroid that is not \(k\)-nearly finitary: Label: en
  10. Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues: Label: en
  11. Binding number, \(k\)-factor and spectral radius of graphs: Label: en
  12. Generalized splines on graphs with two labels and polynomial splines on cycles: Label: en
  13. Extremal results for graphs avoiding a rainbow subgraph: Label: en
  14. Hurwitz orbits on reflection factorizations of parabolic quasi-Coxeter elements: Label: en
  15. Spanning tree bounds for grid graphs: Label: en
  16. Spectral extremal problem on disjoint color-critical graphs: Label: en
  17. Generalized Heawood numbers: Label: en
  18. Irregularity of graphs respecting degree bounds: Label: en
  19. The degree and codegree threshold for linear triangle covering in 3-graphs: Label: en
  20. Weak (2, 3)-decomposition of planar graphs: Label: en
  21. On Rödl's theorem for cographs: Label: en
  22. Edge separators for graphs excluding a minor: Label: en
  23. Face posets of tropical polyhedra and monomial ideals: Label: en
  24. Generalization of Markov Diophantine equation via generalized cluster algebra: Label: en
  25. Ninth variation of classical group characters of type A-D and Littlewood identities: Label: en
  26. A bijection between evil-avoiding and rectangular permutations: Label: en
  27. Permutations with few inversions: Label: en
  28. Planar graphs with the maximum number of induced 6-cycles: Label: en
  29. On \(3\)-uniform hypergraphs avoiding a cycle of length four: Label: en
  30. Lower bounds for the Turán densities of daisies: Label: en
  31. A curious identity arising from Stirling's formula and saddle-point method on two different contours: Label: en
  32. Improved pyrotechnics: closer to the burning number conjecture: Label: en
  33. On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns: Label: en
  34. On the limit of the positive \(\ell\)-degree Turán problem: Label: en
  35. Ramsey numbers with prescribed rate of growth: Label: en
  36. Distribution of external branch lengths in Yule histories: Label: en
  37. Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\): Label: en
  38. Quantum continuants, quantum rotundus and triangulations of annuli: Label: en
  39. An \(A_{\alpha}\)-spectral Erdős-Sós theorem: Label: en
  40. Bounding generalized coloring numbers of planar graphs using coin models: Label: en
  41. Cut vertices in random planar maps: Label: en
  42. Extended double covers and homomorphism bounds of signed graphs: Label: en
  43. The maximum hook length of \(d\)-distinct simultaneous core partitions: Label: en
  44. Irreducible subcube partitions: Label: en
  45. A combinatorial proof of Buryak-Feigin-Nakajima: Label: en
  46. The generalized Frobenius problem via restricted partition functions: Label: en
  47. A pentagonal number theorem for tribone tilings: Label: en
  48. An Ore-type condition for hamiltonicity in tough graphs and the extremal examples: Label: en
  49. Schnyder woods and Alon-Tarsi number of planar graphs: Label: en
  50. Spectral radius of graphs with given size and odd girth: Label: en

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