The following pages link to Klaus Dohmen (Q230778):
Displaying 50 items.
- Domination reliability (Q426770) (← links)
- An abstraction of Whitney's broken circuit theorem (Q470960) (← links)
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity (Q540468) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- A note on Zeilberger's abstract lace expansion (Q696863) (← links)
- Lower bounds for the probability of a union via chordal graphs (Q743043) (← links)
- On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346) (← links)
- On chromaticity of hypergraphs (Q878636) (← links)
- (Q966028) (redirect page) (← links)
- Bonferroni-type inequalities and binomially bounded functions (Q966030) (← links)
- Finite-size scaling in percolation (Q1126802) (← links)
- Inclusion-exclusion and network reliability (Q1128362) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- An improvement of the inclusion-exclusion principle (Q1293322) (← links)
- Improved inclusion-exclusion identities and inequalities based on a particular class of abstract tubes (Q1293635) (← links)
- On sums over partially ordered sets (Q1305172) (← links)
- Equivalence of two conditions on singular components (Q1305266) (← links)
- An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three (Q1306277) (← links)
- A broken-circuits-theorem for hypergraphs (Q1345852) (← links)
- (Q1354841) (redirect page) (← links)
- A gambling system and a Markov chain (Q1354842) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Bounds to the chromatic polynomial of a graph (Q1384128) (← links)
- Covering regular graphs (Q1386472) (← links)
- Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type (Q1412081) (← links)
- Inclusion-exclusion: Which terms cancel? (Q1568652) (← links)
- Improved Bonferroni inequalities via union-closed set systems (Q1586127) (← links)
- Some remarks one the sieve formula, the Tutte polynomial and Crapo's beta invariant (Q1587842) (← links)
- On the number of precolouring extensions (Q1590211) (← links)
- Bonferroni-Galambos inequalities for partition lattices (Q1773163) (← links)
- Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent (Q1840520) (← links)
- Combinatorics of geometrically distributed random variables: Value and position of the \(r\)th left-to-right maximum (Q1841908) (← links)
- A contribution to the chromatic theory of uniform hypergraphs (Q1896647) (← links)
- Directed Moore hypergraphs (Q1902896) (← links)
- Totally unimodular Leontief directed hypergraphs (Q1904049) (← links)
- The largest transversal numbers of uniform hypergraphs (Q1910524) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
- A characterization of cube-hypergraphs (Q1917484) (← links)
- On some properties of DNA graphs (Q1961230) (← links)
- Pancyclicity and NP-completeness in planar graphs (Q1962068) (← links)
- Finding edge-disjoint paths in partial \(k\)-trees (Q1969940) (← links)
- On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results (Q1969944) (← links)
- Sequence independent lifting in mixed integer programming (Q1977865) (← links)
- On the roots of independence polynomials of almost all very well-covered graphs (Q2473044) (← links)
- Percolation on the pre-Sierpinski gasket (Q2565069) (← links)
- (Q2707962) (← links)
- (Q2716014) (← links)
- (Q2725016) (← links)
- (Q2760992) (← links)
