The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- On matroid intersections (Q1166530) (← links)
- On minors of non-binary matroids (Q1166531) (← links)
- On the full automorphism group of a graph (Q1166535) (← links)
- A note on fragments of infinite graphs (Q1166537) (← links)
- Equiarboreal graphs (Q1166542) (← links)
- The longest path in a random graph (Q1166543) (← links)
- Largest random component of a k-cube (Q1166544) (← links)
- The existence of Howell designs of side n+1 and order 2n (Q1167173) (← links)
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields (Q1167174) (← links)
- An upper bound for the cardinality of an s-distance subset in real euclidean space (Q1167178) (← links)
- Forests and score vectors (Q1167181) (← links)
- On Turan's theorem for sparse graphs (Q1167183) (← links)
- Simple proof of the existence of restricted Ramsey graphs by means of a partite construction (Q1167185) (← links)
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower (Q1167186) (← links)
- Combinatorial properties of polyominoes (Q1167188) (← links)
- Minimal decompositions of graphs into mutually isomorphic subgraphs (Q1167190) (← links)
- Balanced two-colorings of finite sets in the square. I (Q1167205) (← links)
- Balancing families of integer sequences (Q1167206) (← links)
- Roth's estimate of the discrepancy of integer sequences is nearly sharp (Q1167207) (← links)
- On Sperner families in which no k sets have an empty intersection. III (Q1167724) (← links)
- Infinite distance transitive graphs of finite valency (Q1167738) (← links)
- Asymptotic values of clique partition numbers (Q1167740) (← links)
- The splittance of a graph (Q1167741) (← links)
- Explicit constructions of graphs without short cycles and low density codes (Q1167742) (← links)
- Cycles through specified vertices of a graph (Q1167744) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Packing nearly-disjoint sets (Q1168975) (← links)
- Canonical edge-colourings of locally finite graphs (Q1168978) (← links)
- Partition conditions and vertex-connectivity of graphs (Q1168985) (← links)
- Maximum degree and fractional matchings in uniform hypergraphs (Q1168988) (← links)
- Graph factors (Q1168989) (← links)
- The eigenvalues of random symmetric matrices (Q1169017) (← links)
- Hermite polynomials and a duality relation for matchings polynomials (Q1169463) (← links)
- Extremal problems, partition theorems, symmetric hypergraphs (Q1170202) (← links)
- Intersection theorems with geometric consequences (Q1171072) (← links)
- Normal subgroups of infinite multiply transitive permutation groups (Q1171125) (← links)
- Symmetric designs with Bruck subdesigns (Q1172062) (← links)
- Recognizing graphic matroids (Q1172064) (← links)
- Irregularities of two-colourings of the NxN square lattice (Q1172093) (← links)
- A class of constructions for Turan's (3,4)-problem (Q1172651) (← links)
- On Reid's 3-simplicial matroid theorem (Q1173094) (← links)
- An upper bound for the number of Eulerian orientations of a regular graph (Q1173620) (← links)
- Approximate inclusion-exclusion (Q1174115) (← links)
- Some non-existence results on divisible difference sets (Q1180404) (← links)
- The existence of non-trivial hyperfactorizations of \(K_{2n}\) (Q1180405) (← links)
- On mod \(p\) transversals (Q1180406) (← links)
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties (Q1180407) (← links)
- Efficient representation of perm groups (Q1180408) (← links)
- Spanning trees with bounded degrees (Q1180410) (← links)
- A mixed version of Menger's theorem (Q1180411) (← links)
