Pages that link to "Item:Q3993087"
From MaRDI portal
The following pages link to Hypergraphs. Combinatorics of finite sets. Transl. from the French (Q3993087):
Displaying 50 items.
- Richardson's theorem in quasi-transitive and pre-transitive digraphs (Q2191277) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Generating functions of some families of directed uniform hypergraphs (Q2199871) (← links)
- Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
- Unimodular hypergraph for DNA sequencing: a polynomial time algorithm (Q2212678) (← links)
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs (Q2227102) (← links)
- Stability and venture structures in multilateral matching (Q2231380) (← links)
- Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
- On the vertex cover number of 3-uniform hypergraph (Q2240114) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- The subalgebra lattice of a finite algebra (Q2248503) (← links)
- Fast algorithms for implication bases and attribute exploration using proper premises (Q2248531) (← links)
- A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes (Q2248536) (← links)
- Analytic methods for uniform hypergraphs (Q2250784) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- The Ryōan-ji axiom for common knowledge on hypergraphs (Q2263050) (← links)
- Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue (Q2272489) (← links)
- On extremal hypergraphs for forests of tight paths (Q2279249) (← links)
- Bounds on upper transversals in hypergraphs (Q2292129) (← links)
- The Wiener index of hypergraphs (Q2292147) (← links)
- Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Reverse mathematics and colorings of hypergraphs (Q2312088) (← links)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals (Q2313415) (← links)
- Decomposing 1-Sperner hypergraphs (Q2315439) (← links)
- Improper sum-list colouring of 2-trees (Q2322872) (← links)
- Sufficient conditions for hypergraphs to be maximally edge-connected (Q2335157) (← links)
- Spectral radii of two kinds of uniform hypergraphs (Q2335791) (← links)
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs (Q2347469) (← links)
- Squarefree monomial ideals that fail the persistence property and non-increasing depth (Q2352390) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
- Spectral radius of uniform hypergraphs (Q2359557) (← links)
- A connection between Hadamard matrices, oriented hypergraphs and signed graphs (Q2361554) (← links)
- Distance (signless) Laplacian spectral radius of uniform hypergraphs (Q2361563) (← links)
- Combinatorial methods for the spectral \(p\)-norm of hypermatrices (Q2361565) (← links)
- Asymptotic sharpness of bounds on hypertrees (Q2364096) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- Antichain cutsets of strongly connected posets (Q2376903) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs (Q2402443) (← links)
- The Laplacian tensor of a multi-hypergraph (Q2407028) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- Uniform clutters and dominating sets of graphs (Q2420426) (← links)
- Upper transversals in hypergraphs (Q2422208) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Odd cycles and \(\Theta\)-cycles in hypergraphs (Q2433709) (← links)
- On stretching the interval simplex-permutohedron (Q2441568) (← links)
- Equality of domination and transversal numbers in hypergraphs (Q2446829) (← links)
- Efficient algorithms for dualizing large-scale hypergraphs (Q2449091) (← links)
