The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- Birth control for giants (Q949755) (← links)
- A phase transition for the metric distortion of percolation on the hypercube (Q949756) (← links)
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
- Homotopy types of box complexes (Q949758) (← links)
- Connected but not path-connected subspaces of infinite graphs (Q949760) (← links)
- Cycles in dense digraphs (Q949775) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Properties of intersecting families of ordered sets (Q949778) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- The combinatorial encoding of disjoint convex sets in the plane (Q949781) (← links)
- Finding coherent cyclic orders in strong digraphs (Q949783) (← links)
- Pfaffian graphs, \(T\)-joins and crossing numbers (Q949784) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Near optimal bounds for the Erdős distinct distances problem in high dimensions (Q949786) (← links)
- Geometric graphs with no two parallel edges (Q949787) (← links)
- Cyclic orders: equivalence and duality (Q949788) (← links)
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs (Q949790) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- An exact Turán result for the generalized triangle (Q949792) (← links)
- Higher correlation inequalities (Q949793) (← links)
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs (Q949794) (← links)
- A separation theorem in property testing (Q949795) (← links)
- The toric ideal of a graphic matroid is generated by quadrics (Q949796) (← links)
- An exploration of locally projective polytopes (Q949797) (← links)
- Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs (Q949799) (← links)
- Coloring even-faced graphs in the torus and the Klein bottle (Q949800) (← links)
- Three-dimensional sets with small sumset (Q949801) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles (Q949803) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- On embeddability and stresses of graphs (Q950325) (← links)
- Multicover inequalities on colored complexes (Q950327) (← links)
- On limits of finite graphs (Q950328) (← links)
- Making a \(K_4\)-free graph bipartite (Q950329) (← links)
- Embedding nearly-spanning bounded degree trees (Q950331) (← links)
- \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams (Q950332) (← links)
- Privileged users in zero-error transmission over a noisy channel (Q950333) (← links)
- On the measure of intersecting families, uniqueness and stability (Q963246) (← links)
- Perfect difference sets constructed from Sidon sets (Q987544) (← links)
- On a graph packing conjecture by Bollobás, Eldridge and Catlin (Q987545) (← links)
- Counting canonical partitions in the random graph (Q987546) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- Density theorems for bipartite graphs and related Ramsey-type results (Q987552) (← links)
- Arc-disjoint in-trees in directed graphs (Q987553) (← links)
- Highly parity linked graphs (Q987554) (← links)
- Ramsey goodness and beyond (Q987556) (← links)
- Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs (Q987557) (← links)
- Hamiltonian cycles in Dirac graphs (Q987558) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
