The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- Packing anchored rectangles (Q276437) (← links)
- Matroid intersection, base packing and base covering for infinite matroids (Q276439) (← links)
- The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
- Small complete minors above the extremal edge density (Q313429) (← links)
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs (Q313432) (← links)
- Chromatic numbers of graphs -- large gaps (Q313434) (← links)
- On the number of matroids (Q313452) (← links)
- Areas of triangles and Beck's theorem in planes over finite fields (Q313454) (← links)
- \(k\)-nets embedded in a projective plane over a field (Q343205) (← links)
- A quantitative Gobbard-Satterthwaite theorem without neutrality (Q343234) (← links)
- On two problems in graph Ramsey theory (Q377800) (← links)
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Alon's nullstellensatz for multisets (Q377804) (← links)
- Equivalence of polynomial conjectures in additive combinatorics (Q377805) (← links)
- Cocliques in the Kneser graph on the point-hyperplane flags of a projective space (Q397059) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees (Q397062) (← links)
- Sparsely intersecting perfect matchings in cubic graphs (Q397063) (← links)
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order \(2p\) (Q397065) (← links)
- Connected Baranyai's theorem (Q397066) (← links)
- Strong approximation in random towers of graphs. (Q397067) (← links)
- Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths (Q397075) (← links)
- Ore's conjecture for \(k=4\) and Grötzsch's theorem (Q397076) (← links)
- Plünnecke and Kneser type theorems for dimension estimates (Q397077) (← links)
- On the minimal Fourier degree of symmetric Boolean functions (Q397079) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Three notions of tropical rank for symmetric matrices (Q452818) (← links)
- Acute triangulations of polyhedra and \(\mathbb R^N\) (Q452820) (← links)
- Projections, entropy and sumsets (Q452821) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- On the Ramsey multiplicity of complete graphs (Q452823) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- A counterexample to the Alon-Saks-Seymour conjecture and related problems (Q452825) (← links)
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- Monotonicity testing and shortest-path routing on the cube (Q452855) (← links)
- On the chromatic numbers of spheres in \(\mathbb R^n\) (Q452856) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Triangulations of the sphere, bitrades and abelian groups (Q484547) (← links)
- The circumference of the square of a connected graph (Q484548) (← links)
- Judicious partitions of uniform hypergraphs (Q484549) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Extremal results for odd cycles in sparse pseudorandom graphs (Q484999) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- Measurable events indexed by products of trees (Q485002) (← links)
