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 #1 to #50.

Multicolor Ramsey numbers for Berge cycles: Label: en
Forbidding \(K_{2,t}\) traces in triple systems: Label: en
On \(3\)-uniform hypergraphs avoiding a cycle of length four: Label: en
On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\): Label: en
Colouring planar mixed hypergraphs: Label: en
On hypergraphs of girth five: Label: en
A further extension of Rödl's theorem: Label: en
Improved lower bounds for multiplicative square-free sequences: Label: en
Gaps in the chromatic spectrum of face-constrained plane graphs: Label: en
Many triangles with few edges: Label: en
Structure and supersaturation for intersecting families: Label: en
Generating functions for permutations which contain a given descent set: Label: en
Spectral extrema for graphs: the Zarankiewicz problem: Label: en
On the weight of Berge-\(F\)-free hypergraphs: Label: en
The maximum spectral radius of graphs without friendship subgraphs: Label: en
A lower bound on the average degree forcing a minor: Label: en
3-uniform hypergraphs without a cycle of length five: Label: en
Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs: Label: en
Generalized rainbow Turán problems: Label: en
On the number of orientations of random graphs with no directed cycles of a given length: Label: en
Cliques in graphs excluding a complete graph minor: Label: en
Average degree conditions forcing a minor: Label: en
On blocking sets of the tangent lines to a nonsingular quadric in \(\text{PG}(3,q), q\) prime: Label: en
Online Ramsey numbers of ordered paths and cycles: Label: en
An \(A_\alpha\)-spectral version of the Bhattacharya-Friedland-Peled conjecture: Label: en
The lexicographically least binary rich word achieving the repetition threshold: Label: en
Graphs with arbitrary Ramsey number and connectivity: Label: en
Coloring hypergraphs from random lists: Label: en
Thresholds, expectation thresholds and cloning: Label: en
Weak Bruhat interval modules for genomic Schur functions: Label: en
On a question of Erdős and Gimbel on the cochromatic number: Label: en
The minimum number of maximal independent sets in twin-free graphs: Label: en
Directed graphs without rainbow stars: Label: en
A characterization of one-element commutation classes: Label: en
\(K_r\)-saturated graphs and the two families theorem: Label: en
The rational number game: Label: en
On generalised majority edge-colourings of graphs: Label: en
A complete solution for a nontrivial ruleset with entailing moves: Label: en
Circumference, minimum degree and clique number: Label: en
Compatible split systems on a multiset: Label: en
An infinite family of connected 1-factorisations of complete 3-uniform hypergraphs: Label: en
Mixed dimer configuration model in Type \(D\) cluster algebras. II: Beyond the acyclic case: Label: en
\((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number: Label: en
Finite \(s\)-geodesic-transitive digraphs: Label: en
The Nevo-Santos-Wilson spheres are shellable: Label: en
New bounds for odd colourings of graphs: Label: en
Graph product structure for \(h\)-framed graphs: Label: en
Extremal graphs for the suspension of edge-critical graphs: Label: en
On a new \((21_4)\) polycyclic configuration: Label: en
Bounds on the lettericity of graphs: Label: en