The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- Some Ramsey-Turán type results for hypergraphs (Q1111567) (← links)
- Contractions of graphs with no spanning Eulerian subgraphs (Q1112064) (← links)
- Hereditary modular graphs (Q1112068) (← links)
- Random interval graphs (Q1112069) (← links)
- A lower bound for finding predecessors in Yao's cell probe model (Q1112590) (← links)
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
- Ramanujan graphs (Q1112836) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- On a lattice point problem of L. Moser. II (Q1112869) (← links)
- Intersection theorems in permutation groups (Q1113278) (← links)
- Large holes in sparse random graphs (Q1113926) (← links)
- Hypergraphs do not jump (Q1114711) (← links)
- Fractional matchings and covers in infinite hypergraphs (Q1115456) (← links)
- Reducing prime graphs and recognizing circle graphs (Q1116953) (← links)
- On sums of subsets of a set of integers (Q1116968) (← links)
- Matrices with prescribed row, column and block sums (Q1117232) (← links)
- A remark on partial linear spaces of girth 5 with an application to strongly regular graphs (Q1117938) (← links)
- How big can the circuits of a bridge of a maximal circuit be? (Q1117943) (← links)
- A cycle-space invariant of the \(<2\)-distance-graph in the plane (Q1117944) (← links)
- Branchings in rooted graphs and the diameter of greedoids (Q1118604) (← links)
- Improved lower bounds on the length of Davenport-Schinzel sequences (Q1119587) (← links)
- On fixing elements in matroid minors (Q1119656) (← links)
- A new lower bound for snake-in-the-box codes (Q1120544) (← links)
- Duality in coherent configurations (Q1120579) (← links)
- Rubber bands, convex embeddings and graph connectivity (Q1121282) (← links)
- Cones of alternating and cut submodular set functions (Q1121293) (← links)
- On the number of \(C_ 5's\) in a triangle-free graph (Q1124605) (← links)
- On the single-source unsplittable flow problem (Q1125608) (← links)
- On linear combinatorics. III: Few directions and distorted lattices (Q1125609) (← links)
- Submodular flow problem with a nonseparable cost function (Q1125610) (← links)
- Uniformly distributed distances -- a geometric application of Janson's inequality (Q1125611) (← links)
- Expanders that beat the eigenvalue bound: Explicit construction and applications (Q1125612) (← links)
- Graphs whose circular chromatic number equals the chromatic number (Q1125613) (← links)
- Ear decompositions of matching covered graphs (Q1125615) (← links)
- Quick approximation to matrices and applications (Q1125616) (← links)
- More-than-nearly-perfect packings and partial designs (Q1125617) (← links)
- The linear-array conjecture in communication complexity is false (Q1125618) (← links)
- On the membership problem for the elementary closure of a polyhedron (Q1125619) (← links)
- The number of \(M\)-sequences and \(f\)-vectors (Q1125653) (← links)
- Mangoes and blueberries (Q1125684) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- The nonexistence of 8-transitive graphs (Q1164637) (← links)
- On a property of n-edge-connected digraphs (Q1164647) (← links)
- An \(n\)-dimensional search problem with restricted questions (Q1165244) (← links)
- How to make a digraph strongly connected (Q1165251) (← links)
- Suresums (Q1165849) (← links)
- Longest paths in digraphs (Q1165864) (← links)
- A nine point theorem for 3-connected graphs (Q1165867) (← links)
- Intersections of k-element sets (Q1166522) (← links)
