scientific article
From MaRDI portal
zbMath0308.05001MaRDI QIDQ4065548
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial probability (60C05) Enumerative combinatorics (05A99) Graph theory (05Cxx) Combinatorics (05-XX)
Related Items
On homogeneous sets of positive integers, Kolmogorov complexity arguments in combinatorics, The knowledge complexity of quadratic residuosity languages, Upslices, downslices, and secret-sharing with complexity of \(1.5^n\), Threshold circuits of bounded depth, Extremal problems for pairs of triangles, Quasi-Random Set Systems, The number of spanning trees in regular graphs, On the difference between asymptotically good packings and coverings, An undecidable problem in finite combinatorics, Nonclassical demand a model-free examination of price-quantity relations in the Marseille fish market, An intersection theorem for four sets, Space-filling subsets of a normal rational curve, Infinite homogeneous bipartite graphs with unequal sides, Using probabilistic models to study the asymptotic behavior of Bell numbers, Ultimate data hiding in quantum mechanics and beyond, Simplex range reporting on a pointer machine, Extremal functions of forbidden multidimensional matrices, Statistical properties of finite sequences with high Kolmogorov complexity, Reliable communication in networks with Byzantine link failures, Hierarchical models as marginals of hierarchical models, Domination in colored complete graphs, Unconditional Byzantine agreement for any number of faulty processors, A Precise Threshold for Quasi-Ramsey Numbers, On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions, Reliable distributed diagnosis for multiprocessor systems with random faults, From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem, Discrepancy of Sums of two Arithmetic Progressions, On metric dimension of nonbinary Hamming spaces, A note on projective norm graphs, The advice complexity of a class of hard online problems, The asymmetry number of finite tournaments, and some related results, Discrepancy in arithmetic progressions, On classes of graphs determined by forbidden subgraphs, Erdős and the integers, Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems, Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph., Cutting a graph into two dissimilar halves, On the number of zero-patterns of a sequence of polynomials, A linear hypergraph extension of the bipartite Turán problem, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Tables of coverings for decoding by S-sets, APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM, A simpler and better derandomization of an approximation algorithm for single source rent-or-buy, On a product dimension of bipartite graphs, The classification of connected-homogeneous digraphs with more than one end, The recovery of ridge functions on the hypercube suffers from the curse of dimensionality, Probabilistic models and relations for special functions. I, SMALL VALUE ESTIMATES FOR THE ADDITIVE GROUP, On local Turán problems, Sieve methods in combinatorics, Extremal subgraphs of random graphs, Proximity problems on line segments spanned by points, Lower Bounds on the Complexity of Polytope Range Searching, Hierarchical vehicle routing problems, Minimum node covers and 2-bicritical graphs, Unnamed Item, Regular pairs in sparse random graphs I, A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings, \(\aleph_0\)-categoricity of semigroups. II., Discrepancy of (centered) arithmetic progressions in \({\mathbb{Z}_p}\), On the chromatic index of almost all graphs, ON ASYMPTOTIC BASES WHICH HAVE DISTINCT SUBSET SUMS, On finite superuniversal graphs, A probabilistic remark on algebraic program testing, Limit theorems for complete subgraphs of random graphs, Checking robust nonsingularity is NP-hard, Complexity of Shallow Networks Representing Finite Mappings, The complexity of Gentzen systems for propositional logic, A note on constructive methods for ramsey numbers, Countable random 𝑝-groups with prescribed Ulm-invariants, Extremal problems for sets forming Boolean algebras and complete partite hypergraphs, On the complexity of approximating the independent set problem, New applications of random sampling in computational geometry, Large induced trees in sparse random graphs, Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register, Applications of random sampling in computational geometry. II, A fast Las Vegas algorithm for triangulating a simple polygon, Random Trees in Random Graphs, Non-adaptive group testing in the presence of errors, Ramsey numbers in complete balanced multipartite graphs. I: Set numbers, Ramsey numbers in complete balanced multipartite graphs. II: Size numbers, Variable neighborhood descent heuristic for covering design problem, Unnamed Item, Norm-graphs and bipartite Turán numbers, On the chromatic forcing number of a random graph, A threshold for perfect matchings in random d-pure hypergraphs, On Erdős-Rado numbers, Sign-balanced covering matrices, On property \(B_r\), The Sum of a Digitaddition Series, A hierarchy of randomness for graphs, Norm-graphs: Variations and applications, Discrepancy of Sums of Arithmetic Progressions, Random knapsacks with many constraints, Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements, Hill Climbing with Multiple Local Optima, Probabilistic methods in coloring and decomposition problems, On sparse approximations to randomized strategies and convex combinations, The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions, Rainbow clique subdivisions, On some aspects of evolution of generalized allocation schemes, Combinatorial Structures on van der Waerden sets, The chromatic number of random graphs, A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses, Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses, Flag algebras, An improved derandomized approximation algorithm for the max-controlled set problem, On unavoidable hypergraphs, Lower bounds on the complexity of simplex range reporting on a pointer machine, Systems of representatives, Almost Every Domain is Universal, Large triangle-free subgraphs in graphs without \(K_ 4\), Random generation of combinatorial structures from a uniform distribution, Asymmetric list sizes in bipartite graphs, An analysis of Monte Carlo algorithms for counting problems, Combinatorics of separation by binary matrices, On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large, Probabilistic methods, Average polynomial time complexity of some NP-complete problems, Large induced degenerate subgraphs, Values and bounds for Ramsey numbers associated with polynomial iteration, Sharp concentration of the chromatic number on random graphs \(G_{n,p}\), On a Ramsey-type problem of Erdős and Pach, A logical approach to asymptotic combinatorics I. First order properties, On Ramsey numbers for large disjoint unions of graphs, Expose-and-merge exploration and the chromatic number of a random graph, On Ramsey numbers of uniform hypergraphs with given maximum degree, An improved algorithm for transitive closure on acyclic digraphs, Ultrafilters on \(\omega\) and atoms in the lattice of uniformities. II, The number of submatrices of a given type in a Hadamard matrix and related results, Probabilistic construction of deterministic algorithms: approximating packing integer programs, On the number of iterations of local improvement algorithms, A certain combinatorial inequality, Hadamard tensors and lower bounds on multiparty communication complexity, Communication in markets. A suggested approach, Spectral distributions of adjacency and Laplacian matrices of random graphs, Certain recurrent and asymptotic estimates in the covering problem, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Locally bounded coverings and factorial properties of graphs, Degree sequences of random graphs, Linear algebraic methods in communication complexity, Forbidden subgraphs in the norm graph, Bounds for the disjoint unions theorem, A problem of Ulam on planar graphs, Representation of graphs, A note on the stability of the estimation of the exponential distribution, Behavior of the connectedness of a random G(n,1/2) graph, A guided tour of Chernoff bounds, Local Turan property for k-graphs, Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem, Lower bounds for recognizing small cliques on CRCW PRAM's, Complexity of finding k-path-free dominating sets in graphs, Extremal geometric constants, An appraisal of computational complexity for operations researchers, On an approximate computation of the height of the maximal upper zero of a monotone Boolean function, On the convergence of ``threshold accepting, Independent sets in regular graphs and sum-free subsets of finite groups, On the complexity of approximating the independent set problem, Universal elements and the complexity of certain classes of infinite graphs, On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, Spectra, Euclidean representations and clusterings of hypergraphs, On existence theorems, A polynomial-time algorithm for computing the yolk in fixed dimension, A tournament approach to pattern avoiding matrices, Covering boxes by points, Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs, Finite-model theory -- A personal perspective, Integer programming in VLSI design, On the number of graphs with a given endomorphism monoid, Countable connected-homogeneous graphs, The computational complexity of universal hashing, Recent developments on graphs of bounded clique-width, Deterministic sampling algorithms for network design, Restricted Ramsey configurations, The early evolution of the \(H\)-free process, Generalized Ramsey theory for multiple colors, The size Ramsey number, Gallai-type results for multiple boxes and forests, An information-theoretic method in combinatorial theory, The maximum number of \(K_j\)-subgraphs in a graph with \(k\) independent edges, The analysis of double hashing, Covering the vertex set of a graph with subgraphs of smaller degree, Asymptotic lower bounds for Ramsey functions, Pólya distributions, combinatorial identities, and generalized stirling numbers, Large random graphs in pseudo-metric spaces, Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems), Delicate symmetry, A deterministic view of random sampling and its use in geometry, Lower bound of the Hadwiger number of graphs by their average degree, Discrepancy in generalized arithmetic progressions, On the maximum cardinality of a consistent set of arcs in a random tournament, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, There is no fast method for finding monochromatic complete subgraphs, On the minimum order of graphs with given semigroup, A note on the probabilistic approach to Turan's problem, On two random search problems, On a packing and covering problem, Random orders, Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces, On color critical graphs, Hamiltonian cycles in random regular graphs, Sidon sets in groups and induced subgraphs of Cayley graphs, Component structure in the evolution of random hypergraphs, How to make a graph bipartite, Power sums of digital sums, The maximum number of disjoint pairs in a family of subsets, An upward measure separation theorem, On Ramsey-Turán type problems in tournaments, Construction techniques for some thin sets in duals of compact abelian groups, On irregularities of distribution in shifts and dilations of integer sequences. I
