The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- Hypergraph families with bounded edge cover or transversal number (Q790130) (← links)
- An extremal set theoretical characterization of some Steiner systems (Q790818) (← links)
- Explicit construction of regular graphs without small cycles (Q790830) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- On restricted colourings of \(K_ n\) (Q793052) (← links)
- On an obstruction for perfect matchings (Q793753) (← links)
- Extremal problems in discrete geometry (Q794651) (← links)
- What must and what need not be contained in a graph of uncountable chromatic number? (Q794660) (← links)
- Regressions and monotone chains: A Ramsey-type extremal problem for partial orders (Q794668) (← links)
- Balancing matrices with line shifts (Q795048) (← links)
- Sparse Ramsey graphs (Q795843) (← links)
- Intersecting Sperner families and their convex hulls (Q796532) (← links)
- Path-closed sets (Q802569) (← links)
- The reconstruction problem for certain infinite graphs (Q802575) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- The classification of distance-regular graphs of type IIB (Q803168) (← links)
- An extremal problem for Graham-Rothschild parameter words (Q803178) (← links)
- How to draw a planar graph on a grid (Q804582) (← links)
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs (Q805627) (← links)
- Balanced extensions of graphs and hypergraphs (Q805632) (← links)
- Pseudorandom bits for constant depth circuits (Q808707) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- Asymptotic solution for a new class of forbidden r-graphs (Q809090) (← links)
- Packing paths in planar graphs (Q809091) (← links)
- Solution of an extremal problem for sets using resultants of polynomials (Q809102) (← links)
- A lower bound for the recognition of digraph properties (Q810043) (← links)
- Infinite spectra in the first order theory of graphs (Q810048) (← links)
- Entropy splitting for antiblocking corners and perfect graphs (Q810528) (← links)
- Minimal partitions of a box into boxes (Q812789) (← links)
- Expanders in group algebras (Q812790) (← links)
- On the number of sets of cycle lengths (Q812791) (← links)
- Lower bounds for concurrent zero knowledge (Q812826) (← links)
- A lower bound for adaptively-secure collective coin flipping protocols (Q822636) (← links)
- A new family of triangulations of \(\mathbb{R} P^d\) (Q822638) (← links)
- The edge-Erdős-Pósa property (Q822640) (← links)
- Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex (Q822644) (← links)
- Extremal problems for transversals in graphs with bounded degree (Q855115) (← links)
- Density conditions for triangles in multipartite graphs (Q858108) (← links)
- A linear bound on the diameter of the transportation polytope (Q858109) (← links)
- On the parameterized intractability of motif search problems (Q858110) (← links)
- Colorings of planar graphs with no rainbow faces (Q858112) (← links)
- Canonical partitions of universal structures (Q858113) (← links)
- An inverse-Ackermann type lower bound for online minimum spanning tree verification (Q858114) (← links)
- Coloring subgraphs of the Rado graph (Q858115) (← links)
- Network design via iterative rounding of setpair relaxations (Q858116) (← links)
- Mader's conjecture on extremely critical graphs (Q858117) (← links)
- Supersaturation for Ramsey-Turán problems (Q858118) (← links)
- Symplectic spaces and ear-decomposition of matroids (Q858119) (← links)
