scientific article
From MaRDI portal
zbMath0674.05001MaRDI QIDQ3993087
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
ON THE NORMALITY OF t-CAYLEY HYPERGRAPHS OF ABELIAN GROUPS, Unnamed Item, Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs, Quasi-Random Set Systems, Disjoint dijoins for classes of dicuts in finite and infinite digraphs, Unnamed Item, Separating Hash Families: A Johnson-type bound and New Constructions, Load balancing in quorum systems, Chromatic uniqueness of zero-divisor graphs, Sum-list-colouring of θ-hypergraphs, On the Erdős–Ginzburg–Ziv invariant and zero-sum Ramsey number for intersecting families, ZERO-ANNIHILATOR 3-UNIFORM HYPERGRAPHS ASSOCIATED WITH RIGHT TERNARY NEAR-RINGS, Embedded associated primes of powers of square-free monomial ideals, The \(\alpha \)-spectral radius of general hypergraphs, Classes of normally and nearly normally torsion-free monomial ideals, Jet graphs, Lattices and hypergraphs associated to square-free monomial ideals, A hyperedge coloring and application in combinatorial testing, Hypergraphs with high projective dimension and 1-dimensional hypergraphs, Risk propagation and evolution analysis of multi-level handlings at automated terminals based on double-layer dynamic network model, Regularity of powers of cover ideals of bipartite graphs, Impartial hypergraph games, Cohomology of Cryo-Electron Microscopy, Sharp bounds for the spectral radii of nonnegative tensors, How to draw a planar clustered graph, On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two, A CNF Class Generalizing Exact Linear Formulas, Total Dual Integrality of Triangle Covering, Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation, Unnamed Item, Unnamed Item, Extremal problems in hypergraph colourings, On the concentration of the independence numbers of random hypergraphs, Structure and complexity of 2-intersection graphs of 3-hypergraphs, Embedding Dimension of a Good Semigroup, Unnamed Item, Unnamed Item, On the eccentric connectivity index of \(k\)-uniform hyper-cacti, Smart elements in combinatorial group testing problems with more defectives, A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals, Unnamed Item, A note on improved upper bounds on the transversal number of hypergraphs, Standard graded vertex cover algebras, cycles and leaves, Decompositions of the 3-uniform hypergraphs \(K_{v}^{(3)}\) into hypergraphs of a certain type, Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic, Enumerating Minimal Transversals of Hypergraphs without Small Holes, On cyclically orientable graphs, Edge intersection graphs of linear 3-uniform hypergraphs, Unnamed Item, Edge intersection graphs of linear 3-uniform hypergraphs, An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph, Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers, Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type, Bouquets, vertex covers and edge ideals, Unnamed Item, Intersections and parallelism inP3-designs, Enumeration of hypergraphs, Totally positive matrices and totally positive hypergraphs, Circular mixed hypergraphs. II: The upper chromatic number, Unnamed Item, Asymptotic state lumping in transport and diffusion problems on networks with applications to population problems, Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms, On distance spectral radius of hypergraphs, Vertex cover algebras of unimodular hypergraphs, Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory, Mario Gionfriddo and mixed hypergraph coloring, Minimal invariant sets in a vertex-weighted graph, A note on a broken-cycle theorem for hypergraphs, An approximation algorithm for the partial vertex cover problem in hypergraphs, Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels, A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs, $H$-kernels by walks in subdivision digraph, Determining the robustness of an interdependent network with a hypergraph model, Distance spectral radii of k-uniform hypertrees with given parameters, Cohomological Aspects of Hypergraphs, Stability of depth functions of cover ideals of balanced hypergraphs, Projective Dimension of String and Cycle Hypergraphs, Unnamed Item, Clique-perfectness of complements of line graphs, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR, Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles, A Formal Context for Acyclic Join Dependencies, Implosive graphs: Square-free monomials on symbolic Rees algebras, Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game, Trees and $n$-Good Hypergraphs, Betti Numbers of Hypergraphs, Linear separation of connected dominating sets in graphs, Unnamed Item, Unnamed Item, A New Entropy for Hypergraphs, On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition, The Edge Ideals of Complete Multipartite Hypergraphs, Some algebraic properties of hypergraphs, Large Homogeneous Submatrices, Stoichiometric and Constraint-Based Analysis of Biochemical Reaction Networks, A stochastic matching model on hypergraphs, Squares of Intersection Graphs and Induced Matchings, The treewidth of 2-section of hypergraphs, Fast, flexible MUS enumeration, Recursive Betti numbers for Cohen-Macaulay \(d\)-partite clutters arising from posets, Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees, Kernels by monochromatic paths and color-perfect digraphs, Graphs, hypergraphs, and properads, Consequences of the packing problem, Bounds on the number of edges in hypertrees, On upper transversals in 3-uniform hypergraphs, Richardson's theorem in \(H\)-coloured digraphs, Path-based depth-first search for strong and biconnected components, Generating all maximal models of a Boolean expression, Maximum number of colors in hypertrees of bounded degree, An order theoretic framework for overlapping clustering, Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees, Completion and decomposition of hypergraphs into dominating sets of graphs, Fractional v. integral covers in hypergraphs of bounded edge size, Bounds on the game transversal number in hypergraphs, Motivations and history of some of my conjectures, The monochromatic block number, On the principal eigenvectors of uniform hypergraphs, Minimal connected \(\tau\)-critical hypergraphs, On generalized Kneser hypergraph colorings, Associativity and non-associativity of some hypergraph products, Mixed interval hypergraphs, Hall's and Kőnig's theorem in graphs and hypergraphs, \(H\)-kernels in infinite digraphs, A note on the Erdős--Farber--Lovász conjecture, The skiving stock problem and its relation to hypergraph matchings, Recognizing intersection graphs of linear uniform hypergraphs, A characterization of oriented hypergraphic Laplacian and adjacency matrix coefficients, Tree representations of graphs, On the Hamming distance in combinatorial optimization problems on hypergraph matchings, The cyclicity of a hypergraph, Locating-dominating sets in hypergraphs, Optimal resource allocation enables mathematical exploration of microbial metabolic configurations, Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs, On the Varshamov-Tenengolts construction on binary strings, Oriented hypergraphs: introduction and balance, On regular hypergraphs of high girth, Maximum number of colors: C-coloring and related problems, \(\Pi\)-kernels in digraphs, The existence spectrum of Meta\((K^{(3)}_{4} > K^{(3)}_{4} - e)\), On optimality of a polynomial algorithm for random linear multidimensional assignment problem, Subgraph trees in graph theory, Interior and exterior functions of positive Boolean functions., Autonomous sets for the hypergraph of all canonical covers, Fast factorization of Cartesian products of (directed) hypergraphs, On the normality of Rees algebras associated to totally unimodular matrices, Birational contractions of \(\overline{\mathrm{M}}_{0,n}\) and combinatorics of extremal assignments, On distance spectral radius of uniform hypergraphs with cycles, 2-regular equicolourings for \(\mathbf P_4\)-designs, Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs, Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover, Synchronous vs. asynchronous unison, A note on hypertournaments, Mathematical morphology on hypergraphs using vertex-hyperedge correspondence, An abstraction of Whitney's broken circuit theorem, Hypergraphs of multiparty secrets, An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs, Vertex and edge dimension of hypergraphs, Computational aspects of monotone dualization: a brief survey, Self-duality of bounded monotone Boolean functions and related problems, Monochromatic connecting colorings in strongly connected oriented graphs, Hypergraphs and hypermatrices with symmetric spectrum, Semigroup approach to diffusion and transport problems on networks, A Richardson's theorem version for \(\Pi\)-kernels, Strongly connected multivariate digraphs, Declarative operations on nets, On the covering number \(c_\lambda(3,W_4^{(3)}, v)\), Hypergraph polytopes, Exact localisations of feedback sets, Covering triangles in edge-weighted graphs, On finding hypercycles in chemical reaction networks, Masking patterns in sequences: A new class of motif discovery with don't cares, Phylogenetic diversity and the maximum coverage problem, Distance spectral radius of uniform hypergraphs, On the fractional chromatic number of monotone self-dual Boolean functions, A randomised approximation algorithm for the hitting set problem, On an extension of Knuth's rotation correspondence to reduced planar trees, A fast algorithm for query optimization in universal-relation databases, On the stochastic independence properties of hard-core distributions, Two-regular subgraphs of hypergraphs, Lower bounds for three algorithms for transversal hypergraph generation, A framework for decision support systems of scheduling problems, Decomposition of a hypergraph by partial-edge separators, A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations, Vertex-monochromatic connectivity of strong digraphs, The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs, Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices, A mathematical approach on representation of competitions: competition cluster hypergraphs, The circular chromatic number of hypergraphs, Chromatic index of hypergraphs and Shannon's theorem, Edge-disjoint odd cycles in graphs with small chromatic numbers, Determination of the packing number \(D_{\lambda }(3,W_4^{(3)},\nu )\), Interpolation theorems for graphs, hypergraphs and matroids, On the domination of hypergraphs by their edges, Pseudo-chordal mixed hypergraphs, Transferability of collective transportation line networks from a topological and passenger demand perspective, Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs, Avoiding arithmetic progressions in cyclic groups, Minimal balanced collections and their application to core stability and other topics of game theory, On hamiltonian line graphs of hypergraphs, The prime submodules hypergraph of a free module of finite rank over a commutative ring, Coloring directed hypergraphs, Cosh gradient systems and tilting, Planarity for clustered graphs, Successive vertex orderings of fully regular graphs, The generalized microscopic image reconstruction problem for hypergraphs, On the transversal number of rank \(k\) hypergraphs, On the transversal number of \(k\)-uniform connected hypergraphs, Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials, Chordal graphs and their clique graphs, Celebrating Loday's associahedron, Dually chordal graphs, Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms, The iterated local transitivity model for hypergraphs, On minimally non-firm binary matrices, Hypergraph LSS-ideals and coordinate sections of symmetric tensors, A proof of a conjecture on the distance spectral radius, Fast winning strategies for staller in the maker-breaker domination game, Dominoes, The algorithmic use of hypertree structure and maximum neighbourhood orderings, On the irregularity of uniform hypergraphs, Packing and covering with balls on Busemann surfaces, Spectral radius of uniform hypergraphs, A connection between Hadamard matrices, oriented hypergraphs and signed graphs, Distance (signless) Laplacian spectral radius of uniform hypergraphs, Combinatorial methods for the spectral \(p\)-norm of hypermatrices, Triplication for BSTSs and uncolourability, Dual-bounded generating problems: Weighted transversals of a hypergraph, Simplicial trees are sequentially Cohen-Macaulay, Asymptotic sharpness of bounds on hypertrees, Minimal paths and cycles in set systems, Dynamic evolution of shipping network based on hypergraph, Emergence of scaling in evolving hypernetworks, Antichain cutsets of strongly connected posets, Weighted 2-sections and hypergraph reconstruction, On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs, Dimensionality of ordinal structures, On the feedback number of 3-uniform linear extremal hypergraphs, Combinatorial games on a graph, Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs, The Laplacian tensor of a multi-hypergraph, Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common, \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem, H-kernels by walks in an \(R_H (D)\) digraph, Interior and exterior functions of Boolean functions, Mixed covering arrays on 3-uniform hypergraphs, On some graph classes related to perfect graphs: a survey, Uniform clutters and dominating sets of graphs, Upper transversals in hypergraphs, Richardson's theorem in quasi-transitive and pre-transitive digraphs, Concepts on coloring of cluster hypergraphs with application, Generating functions of some families of directed uniform hypergraphs, A survey on hypergraph products, Perfect graphs, kernels, and cores of cooperative games, Odd cycles and \(\Theta\)-cycles in hypergraphs, Handling and measuring inconsistency in non-monotonic logics, On stretching the interval simplex-permutohedron, Unimodular hypergraph for DNA sequencing: a polynomial time algorithm, Uncolorable mixed hypergraphs, Equality of domination and transversal numbers in hypergraphs, On least distance eigenvalue of uniform hypergraphs, Efficient algorithms for dualizing large-scale hypergraphs, Strong products of hypergraphs: unique prime factorization theorems and algorithms, \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs, Sharp bounds for ordinary and signless Laplacian spectral radii of uniform hypergraphs, Stability and venture structures in multilateral matching, Some applications of Wagner's weighted subgraph counting polynomial, Coloring Delaunay-edges and their generalizations, On the vertex cover number of 3-uniform hypergraph, Anti-Ramsey problems for cycles, The subalgebra lattice of a finite algebra, Fast algorithms for implication bases and attribute exploration using proper premises, A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes, Analytic methods for uniform hypergraphs, Mycielski type constructions for hypergraphs associated with fractional colorings, On edge-sets of bicliques in graphs, The Ryōan-ji axiom for common knowledge on hypergraphs, Combinatorics of unavoidable complexes, A note on fractional disjoint transversals in hypergraphs, Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach, Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue, On extremal hypergraphs for forests of tight paths, Regularity of powers of cover ideals of unimodular hypergraphs, Bounds on upper transversals in hypergraphs, The Wiener index of hypergraphs, Directed hypergraphs and applications, Making a tournament indecomposable by one subtournament-reversal operation, Affine planes and transversals in 3-uniform linear hypergraphs, Cost-efficient mixed-level covering designs for testing experiments, Hypertrees, Syntactic stochastic processes: definitions, models, and related inference problems, Efficiently enumerating hitting sets of hypergraphs arising in data profiling, Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems, Packing properties of cubic square-free monomial ideals, Properties of unique degree sequences of 3-uniform hypergraphs, On the reconstruction of 3-uniform hypergraphs from step-two degree sequences, Resolution based algorithms for the transversal hypergraph generation problem, Recursion relations for chromatic coefficients for graphs and hypergraphs, Reverse mathematics and colorings of hypergraphs, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Decomposing 1-Sperner hypergraphs, Improper sum-list colouring of 2-trees, Steps towards causal Formal Concept Analysis, Projective dimension of hypergraphs, Deformation cones of graph associahedra and nestohedra, Strong total chromatic numbers of complete hypergraphs, Maximum size of a graph with given fractional matching number, Sufficient conditions for hypergraphs to be maximally edge-connected, Spectral radii of two kinds of uniform hypergraphs, A polynomial algorithm for the strong Helly property, Coloring face-hypergraphs of graphs on surfaces, Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs, A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size, Squarefree monomial ideals that fail the persistence property and non-increasing depth, Intersection graphs of maximal hypercubes, Algebraic invariants of weighted oriented graphs, Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications, Hypergraph Turán numbers of vertex disjoint cycles, An extension of Richardson's theorem in m-colored digraphs, A study on the existence of null labelling for 3-hypergraphs
