The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- Asymptotically optimal \(k\)-step nilpotency of quadratic algebras and the Fibonacci numbers (Q682120) (← links)
- A short proof of Gowers' lower bound for the regularity lemma (Q682130) (← links)
- An extension of Nathanson's theorem on representation functions (Q682137) (← links)
- The influence of large coalitions (Q684398) (← links)
- Cycles through specified vertices (Q684399) (← links)
- Bases-cobases graphs and polytopes of matroids (Q684402) (← links)
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- Remarks on the density of sphere packings in three dimensions (Q684405) (← links)
- Preperfect graphs (Q684406) (← links)
- On depth first search trees in \(m\)-out digraphs (Q684408) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- A note on matrix rigidity (Q684412) (← links)
- The cost of the missing bit: Communication complexity with help (Q700359) (← links)
- Random graph coverings. I: General theory and graph connectivity (Q700369) (← links)
- Perfect graphs, partitionable graphs and cutsets (Q700371) (← links)
- Large cliques in \(C_4\)-free graphs (Q700383) (← links)
- Cycles of nonzero elements in low rank matrices (Q700384) (← links)
- Two tree-width-like graph invariants (Q705708) (← links)
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem (Q705722) (← links)
- On the value of a random minimum weight Steiner tree (Q705741) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree (Q705743) (← links)
- Nonexistence of a Kruskal-Katona type theorem for subword orders (Q705744) (← links)
- An explicit construction for a Ramsey problem (Q705745) (← links)
- On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs (Q705747) (← links)
- High connectivity keeping sets in \(n\)-connected graphs (Q705749) (← links)
- Transitivity and connectivity of permutations (Q705750) (← links)
- A lower bound on the integrality gap for minimum multicut in directed networks (Q705752) (← links)
- The maximum size of graphs with a unique \(k\)-factor (Q705753) (← links)
- Cocliques in the Kneser graph on line-plane flags in \(\mathrm{PG}(4, Q)\) (Q722306) (← links)
- The fractional chromatic number of the plane (Q722307) (← links)
- The Voronoi functional is maximized by the Delaunay triangulation in the plane (Q722309) (← links)
- Induced subgraphs of graphs with large chromatic number. III: Long holes (Q722311) (← links)
- Decomposing a graph into forests: the nine dragon tree conjecture is true (Q722313) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Proof of Schur's conjecture in \(\mathbb R^D\) (Q722315) (← links)
- Maximum scattered linear sets and complete caps in Galois spaces (Q722320) (← links)
- Connected tree-width (Q722321) (← links)
- On the chromatic number of a simplicial complex (Q722323) (← links)
- The number of unit-area triangles in the plane: theme and variation (Q722324) (← links)
- Point-curve incidences in the complex plane (Q722326) (← links)
- Local convergence of random graph colorings (Q722328) (← links)
- More distinct distances under local conditions (Q722329) (← links)
- Intervals of permutation class growth rates (Q722339) (← links)
- Infinite graphic matroids (Q722341) (← links)
- Conway groupoids and completely transitive codes (Q722342) (← links)
- Associahedra via spines (Q722343) (← links)
- Weight distribution of translates of MDS codes (Q749509) (← links)
- Inseparability graphs of oriented matroids (Q750448) (← links)
- The chromatic number of random graphs at the double-jump threshold (Q751675) (← links)
