scientific article; zbMATH DE number 830463

No author found.

Publication date: 8 January 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15)

Related Items

A uniform stability principle for dual lattices, Union Closed Tree Convex Sets, Local Expansion of Symmetrical Graphs, Unavoidable Induced Subgraphs of Large 2-Connected Graphs, The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs, K₂‐Hamiltonian graphs: II, On the intersection density of the Kneser graph $K(n, 3)$, The Number of Star Operations on Numerical Semigroups and on Related Integral Domains, Saturated Graphs of Prescribed Minimum Degree, Extremal Theory of Locally Sparse Multigraphs, Mod 3 arithmetic on triangulated Riemann surfaces, Homological and finiteness properties of picture groups, Why Is Pi Less Than Twice Phi?, 1.61-approximation for min-power strong connectivity with two power levels, Unnamed Item, The determining number of a Cartesian product, Unnamed Item, Asymptotic for the number of star operations on one-dimensional Noetherian domains, Unnamed Item, Unnamed Item, $K_2$-Hamiltonian Graphs: I, Direct Sum Testing, On the class semigroup of a numerical semigroup, Box complexes, neighborhood complexes, and the chromatic number, A decomposition of 2-weak vertex-packing polytopes, SIS epidemic propagation on hypergraphs, Packing large trees of consecutive orders, Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs, The neighborhood complexes of almost $s$-stable Kneser graphs, A linear-time algorithm for the orbit problem over cyclic groups, Delaunay triangulations of closed Euclidean $d$-orbifolds, Quantified conjunctive queries on partially ordered sets, The union-closed sets conjecture almost holds for almost all random bipartite graphs, Hermitian Veronesean Caps, Holomorphic transforms with application to affine processes, On the Hadwiger's conjecture for graph products, Solving MIPs via scaling-based augmentation, Helly numbers of polyominoes, Uniform random posets, The path partition conjecture is true for claw-free graphs, A sufficient condition for cyclability in directed graphs, The topology of spaces of phylogenetic trees with symmetry, Scalable resetting algorithms for synchronization of pulse-coupled oscillators over rooted directed graphs, Spectra of twists of Cayley and Cayley sum graphs, Unification and combination of a class of traversal strategies made with pattern matching and fixed-points, Bisecting and $D$-secting families for set systems, Quantified Conjunctive Queries on Partially Ordered Sets, Optimal identification of sets of edges using 2-factors, Identifying codes on directed de Bruijn graphs, Zero-sum magic labelings and null sets of regular graphs, Solving projected model counting by utilizing treewidth and its limits, A permutation group determined by an ordered set, Long induced paths in minor-closed graph classes and beyond, On cages admitting identifying codes, A note on shellability and acyclic orientations, Brain and its universal logical model of multi-agent biological systems, Pachinko, Sets with large additive energy and symmetric sets, $k$-outerplanar graphs, planar duality, and low stretch spanning trees, Superembedding methods for 4d $N$-extended SCFTs, Tight bounds for shared memory systems accessed by Byzantine processes, Conical and spherical graphs, On the topology of simplicial complexes related to 3-connected and Hamiltonian graphs, Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems, Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications, The graph formulation of the union-closed sets conjecture, Spiders everywhere, Symmetric products of surfaces and the cycle index, Vertex embeddings of regular polytopes, The minimal number of generators of a finite semigroup., Turán and Ramsey numbers in linear triple systems, Knots of genus one or on the number of alternating knots of given genus, Contractibility and the clique graph operator, Lexicographic Gröbner bases for transportation problems of format $r\times 3\times 3$, Vector subspaces of finite fields and star operations on pseudo-valuation domains, A constructive proof of the ordinal efficiency welfare theorem, Choosability of graphs with infinite sets of forbidden differences, Deciding nonconstructibility of 3-balls with spanning edges and interior vertices, The fundamental group and Betti numbers of toric origami manifolds, The full automorphism groups, determining sets and resolving sets of coprime graphs, Permutation groups, minimal degrees and quantum computing., On the Markov Transition Kernels for First Passage Percolation on the Ladder, Chords in longest cycles, On the diameter of permutation groups, The multicovering radius problem for some types of discrete structures, Combinatorial models for the finite-dimensional Grassmannians, The Möbius function of factor order, A note on a cycle partition problem, Putting continuous metaheuristics to work in binary search spaces, Complexity results on restricted instances of a paint shop problem for words, One-point suspensions and wreath products of polytopes and spheres, Model selection in the space of Gaussian models invariant by symmetry, Efficient approximation algorithms for the achromatic number, A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes, Statistics for biquadratic covers of the projective line over finite fields. With an appendix by Alina Bucur, Finite solvable groups whose Quillen complex is Cohen-Macaulay., Coloring $d$-embeddable $k$-uniform hypergraphs, Improved approximation algorithms for $k$-connected $m$-dominating set problems, Comparisons of multistate models with discrete-time pure-birth process for recurrent events and uncertain parameters, Computing small partial coverings, Uniqueness of Self-Similar Solutions to the Network Flow in a Given Topological Class, Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs, On zero-sum 6-flows of graphs, Persistent homology in $\ell_\infty$ metric, Fast algorithms for fair dynamic load redistribution in heterogeneous environments, Competition polysemy, The solution of two problems on bound polysemy, A parameterized view on matroid optimization problems, On modular homology in projective space, Circuit double covers in special types of cubic graphs, On a Turán-type hypergraph problem of Brown, Erdős and T. Sós, Perspectives on $A$-homotopy theory and its applications, On the topology of two partition posets with forbidden block sizes, Complete tripartite subgraph in the coprime graphs of integers, Counting alternating knots by genus, Colored homomorphisms of colored mixed graphs, Covering non-uniform hypergraphs, Products of circulant graphs are metacirculant., On the bipartite independence number of a balanced bipartite graph, Information retrieval with unambiguous output, Optimal monomial quadratization for ODE systems, Counting acyclic hypergraphs