Entity usage

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.

Showing below up to 50 results in range #51 to #100.

The largest crossing number of tanglegrams: Label: en
Poset structure concerning cylindric diagrams: Label: en
Reflect-push methods. Part I: Two dimensional techniques: Label: en
Cobiased graphs: single-element extensions and elementary quotients of graphic matroids: Label: en
Enumeration of sets of mutually orthogonal Latin rectangles: Label: en
A spectral extremal problem on non-bipartite triangle-free graphs: Label: en
Bidding combinatorial games: Label: en
Hadamard matrices of orders 60 and 64 with automorphisms of orders 29 and 31: Label: en
The zonotopal algebra of the broken wheel graph and its generalization: Label: en
Demazure product of permutations and hopping: Label: en
Cores of partitions in rectangles: Label: en
Logarithms of Catalan generating functions: a combinatorial approach: Label: en
Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision: Label: en
On the concentration of the chromatic number of random graphs: Label: en
Sharp degree bounds for fake weighted projective spaces: Label: en
A discrete variation of the Littlewood-Offord problem: Label: en
Wiener indices of minuscule lattices: Label: en
Tree automata and pigeonhole classes of matroids. II: Label: en
Rowmotion on 321-avoiding permutations: Label: en
Bijective proofs of Monk's rule for Schubert and double Schubert polynomials with bumpless pipe dreams: Label: en
\(P\)-polynomial weakly distance-regular digraphs: Label: en
On the location of chromatic zeros of series-parallel graphs: Label: en
Random cubic planar maps: Label: en
Solutions to seven and a half problems on tilings: Label: en
Hadamard matrices related to projective planes: Label: en
Component behaviour and excess of random bipartite graphs near the critical point: Label: en
Generating \(I\)-eigenvalue free threshold graphs: Label: en
Combinatorial constructions of generating functions of cylindric partitions with small profiles into unrestricted or distinct parts: Label: en
The complexity of the matroid homomorphism problem: Label: en
The number of occurrences of patterns in a random tree or forest permutation: Label: en
A Cantor-Bendixson rank for siblings of trees: Label: en
The Park-Pham theorem with optimal convergence rate: Label: en
Estimating global subgraph counts by sampling: Label: en
Rooted prism-minors and disjoint cycles containing a specified edge: Label: en
Induced subgraphs and path decompositions: Label: en
Generalized Alder-type partition inequalities: Label: en
Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs: Label: en
Edge and pair queries-random graphs and complexity: Label: en
Generalized Riemann functions, their weights, and the complete graph: Label: en
Characterizing planar tanglegram layouts and applications to edge insertion problems: Label: en
Behaviour of the normalized depth function: Label: en
Ramsey numbers of large even cycles and fans: Label: en
Hypermaps over non-abelian simple groups and strongly symmetric generating sets: Label: en
Graph rigidity properties of Ramanujan graphs: Label: en
The lexicographically least square-free word with a given prefix: Label: en
Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets: Label: en
Graphs isomorphisms under edge-replacements and the family of amoebas: Label: en
Extremal independent set reconfiguration: Label: en
A further extension of Rödl's theorem: Label: en
Bounding branch-width: Label: en