Bouchet, André Reducing prime graphs and recognizing circle graphs. (English) Zbl 0666.05037 Combinatorica 7, 243-254 (1987). Reviewer: M.M.Sysło MSC: 05C20 × Cite Format Result Cite Review PDF Full Text: DOI
Frieze, A. M.; Jackson, B. Large holes in sparse random graphs. (English) Zbl 0662.05052 Combinatorica 7, 265-274 (1987). Reviewer: O.Frank MSC: 05C80 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Bárányi, I. An extension of the Erdős-Szekeres theorem on large angles. (English) Zbl 0655.51007 Combinatorica 7, 161-169 (1987). Reviewer: H.Brauner MSC: 51M05 52A10 × Cite Format Result Cite Review PDF Full Text: DOI
Sane, Sharad S.; Shrikhande, Mohan S. Quasi-symmetric 2,3,4-designs. (English) Zbl 0655.05012 Combinatorica 7, 291-301 (1987). Reviewer: S.Kageyama MSC: 05B05 05B25 × Cite Format Result Cite Review PDF Full Text: DOI
Hall, J. I. A local characterization of the Johnson scheme. (English) Zbl 0653.05019 Combinatorica 7, 77-85 (1987). Reviewer: S.Kageyama MSC: 05B99 05C25 × Cite Format Result Cite Review PDF Full Text: DOI
Raghavan, P.; Thompson, C. D. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. (English) Zbl 0651.90052 Combinatorica 7, 365-374 (1987). Reviewer: J.Terno MSC: 90C10 × Cite Format Result Cite Review PDF Full Text: DOI
Björner, A.; Frankl, P.; Stanley, R. The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem. (English) Zbl 0651.05010 Combinatorica 7, 23-34 (1987). MSC: 05A15 55U05 × Cite Format Result Cite Review PDF Full Text: DOI
Matula, D. W. Expose-and-merge exploration and the chromatic number of a random graph. (English) Zbl 0648.05049 Combinatorica 7, 275-284 (1987). MSC: 05C80 05C15 × Cite Format Result Cite Review PDF Full Text: DOI
Bollobás, Béla; Thomason, A. Threshold functions. (English) Zbl 0648.05048 Combinatorica 7, 35-38 (1987). MSC: 05C80 60C05 × Cite Format Result Cite Review PDF Full Text: DOI
Bern, Marshall; Klawe, Maria; Wong, Alice Bounds on the convex label number of trees. (English) Zbl 0646.05021 Combinatorica 7, 221-230 (1987). Reviewer: A.Tucker MSC: 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Abbott, H. L.; Liu, A. On a problem of Erdős concerning property B. (English) Zbl 0645.05002 Combinatorica 7, 215-219 (1987). Reviewer: P.Horák MSC: 05A05 × Cite Format Result Cite Review PDF Full Text: DOI
Vazirani, U. V. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources. (English) Zbl 0643.94002 Combinatorica 7, 375-392 (1987). MSC: 94A05 × Cite Format Result Cite Review PDF Full Text: DOI
Olson, J. E. A problem of Erdős on Abelian groups. (English) Zbl 0643.20031 Combinatorica 7, 285-289 (1987). MSC: 20K01 20D60 11D04 × Cite Format Result Cite Review PDF Full Text: DOI
Feofiloff, P.; Younger, D. H. Directed cut transversal packing for source-sink connected graphs. (English) Zbl 0642.05027 Combinatorica 7, 255-263 (1987). Reviewer: Wai-Kai Chen MSC: 05C20 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Stiebitz, M. Subgraphs of colour-critical graphs. (English) Zbl 0642.05020 Combinatorica 7, 303-312 (1987). Reviewer: N.Quimpo MSC: 05C15 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Frank, András; Tardos, Éva An application of simultaneous diophantine approximation in combinatorial optimization. (English) Zbl 0641.90067 Combinatorica 7, 49-65 (1987). MSC: 90C27 68Q25 90C10 90C35 90B10 × Cite Format Result Cite Review PDF Full Text: DOI
Anderson, R. A parallel algorithm for the maximal path problem. (English) Zbl 0641.68105 Combinatorica 7, 315-326 (1987). MSC: 68R10 68Q25 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Levin, L. A. One way functions and pseudorandom generators. (English) Zbl 0641.68061 Combinatorica 7, 357-363 (1987). MSC: 68Q25 94A60 65C10 × Cite Format Result Cite Review PDF Full Text: DOI
Bixby, Robert E.; Coullard, C. R. Finding a small 3-connected minor maintaining a fixed minor and a fixed element. (English) Zbl 0639.05013 Combinatorica 7, 231-242 (1987). Reviewer: A.Recski MSC: 05B35 × Cite Format Result Cite Review PDF Full Text: DOI
Bollobás, Béla; Fenner, T. I.; Frieze, A. M. An algorithm for finding Hamilton paths and cycles in random graphs. (English) Zbl 0638.05036 Combinatorica 7, 327-341 (1987). Reviewer: C.Thomassen MSC: 05C45 05C80 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Jimbo, S.; Maruoka, A. Expanders obtained from affine transformations. (English) Zbl 0637.05017 Combinatorica 7, 343-355 (1987). MSC: 05C50 × Cite Format Result Cite Review PDF Full Text: DOI
Sharir, M. Almost linear upper bounds on the length of general Davenport-Schinzel sequences. (English) Zbl 0636.05004 Combinatorica 7, 131-143 (1987). Reviewer: M. Sharir MSC: 05A05 05A15 11B83 × Cite Format Result Cite Review PDF Full Text: DOI
Mulmuley, K. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. (English) Zbl 0635.65040 Combinatorica 7, 101-104 (1987). Reviewer: W.Schönauer MSC: 65F30 15A03 65Y05 × Cite Format Result Cite Review PDF Full Text: DOI
Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. Matching is as easy as matrix inversion. (English) Zbl 0632.68041 Combinatorica 7, 105-113 (1987). Reviewer: T.Walsh MSC: 68Q25 68R10 05C10 05C70 05C50 × Cite Format Result Cite Review PDF Full Text: DOI
Shamir, E.; Spencer, J. Sharp concentration of the chromatic number on random graphs \(G_{n,p}\). (English) Zbl 0632.05024 Combinatorica 7, 121-129 (1987). Reviewer: O.Frank MSC: 05C15 05C80 60C05 × Cite Format Result Cite Review PDF Full Text: DOI
Alon, N.; Boppana, R. B. The monotone circuit complexity of Boolean functions. (English) Zbl 0631.68041 Combinatorica 7, 1-22 (1987). Reviewer: L.Livovschi MSC: 68Q25 68R10 94C10 × Cite Format Result Cite Review PDF Full Text: DOI
Alon, N.; Kleitman, D. J.; Pomerance, C.; Saks, M.; Seymour, P. The smallest n-uniform hypergraph with positive discrepancy. (English) Zbl 0629.05053 Combinatorica 7, 151-160 (1987). Reviewer: J.E.Graver MSC: 05C65 05C15 × Cite Format Result Cite Review PDF Full Text: DOI
Prömel, H.-J.; Rothschild, B. L. A canonical restricted version of van der Waerden’s theorem. (English) Zbl 0629.05007 Combinatorica 7, 115-119 (1987). Reviewer: Yu.M.Voloshin MSC: 05A17 05C55 × Cite Format Result Cite Review PDF Full Text: DOI
Thomassen, C. On digraphs with no two disjoint directed cycles. (English) Zbl 0628.05034 Combinatorica 7, 145-150 (1987). Reviewer: G.Chaty MSC: 05C20 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Luks, E. M. Computing the composition factors of a permutation group in polynomial time. (English) Zbl 0627.20002 Combinatorica 7, 87-99 (1987). Reviewer: J.Neubüser MSC: 20B05 20-04 20B35 68W99 20B15 20D30 × Cite Format Result Cite Review PDF Full Text: DOI
Dress, Andreas; Lovász, László On some combinatorial properties of algebraic matroids. (English) Zbl 0627.05016 Combinatorica 7, 39-48 (1987). Reviewer: A.Recski MSC: 05B35 × Cite Format Result Cite Review PDF Full Text: DOI
Gröflin, H. On switching paths polyhedra. (English) Zbl 0625.52006 Combinatorica 7, 193-204 (1987). Reviewer: P.Reichensperger MSC: 52Bxx 05C20 90C35 90B10 05C38 49J35 × Cite Format Result Cite Review PDF Full Text: DOI
Friedman, J.; Pippenger, N. Expanding graphs contain all small trees. (English) Zbl 0624.05028 Combinatorica 7, 71-76 (1987). Reviewer: A.Tucker MSC: 05C05 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Kano, M. Maximum of k-th maximal spanning trees of a weighted graph. (English) Zbl 0624.05027 Combinatorica 7, 205-214 (1987). Reviewer: A.Tucker MSC: 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Frankl, P. On a pursuit game on Cayley graphs. (English) Zbl 0621.05017 Combinatorica 7, 67-70 (1987). MSC: 05C25 91A24 × Cite Format Result Cite Review PDF Full Text: DOI