The following pages link to Martin Loebl (Q185366):
Displaying 50 items.
- Bass' identity and a coin arrangements lemma (Q412265) (← links)
- DNA-inspired information concealing: a survey (Q465664) (← links)
- Discrete Dirac operators, critical embeddings and Ihara-Selberg functions (Q490310) (← links)
- Cubic bridgeless graphs and braces (Q503640) (← links)
- On the optimality of the Arf invariant formula for graph polynomials (Q610678) (← links)
- (Q675906) (redirect page) (← links)
- Clutters and circuits (Q675907) (← links)
- On algebraic matroids (Q686488) (← links)
- A permanent formula for the Jones polynomial (Q719783) (← links)
- A hierarchy of totally unimodular matrices (Q802628) (← links)
- A non-commutative formula for the colored Jones function (Q863407) (← links)
- Perfect matching preservers (Q870013) (← links)
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function (Q877731) (← links)
- Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs (Q1010870) (← links)
- The enumeration of planar graphs via Wick's theorem (Q1023045) (← links)
- Epidemiography. II: Games with a dozing yet winning player (Q1106113) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- (Q1193710) (redirect page) (← links)
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs (Q1193711) (← links)
- Unprovable combinatorial statements (Q1201266) (← links)
- On the theory of Pfaffian orientations. I: Perfect matchings and permanents (Q1277143) (← links)
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration (Q1277144) (← links)
- Incidence and strong edge colorings of graphs (Q1313849) (← links)
- Efficient subgraphs packing (Q1321999) (← links)
- Incremental construction of 2-structures (Q1322177) (← links)
- Frame matroids and biased graphs (Q1329081) (← links)
- Basis-transitive matroids (Q1330169) (← links)
- How many \(1\times 2\times 4\) bricks can you get into an odd box? (Q1336686) (← links)
- Interpolating set partition statistics (Q1337170) (← links)
- A linear upper bound in extremal theory of sequences (Q1337178) (← links)
- A note on a conjecture of Ryser (Q1346392) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- On projective embeddings of partial planes and rank-three matroids (Q1356525) (← links)
- On rounded five-element lines of matroids (Q1356531) (← links)
- Matroids arisen from matrogenic graphs (Q1356745) (← links)
- The Hadamard matroid and an anomaly in its single element extensions (Q1356846) (← links)
- External and internal elements of a matroid basis (Q1377712) (← links)
- A note on the trinomial analogue of Bailey's lemma (Q1380342) (← links)
- Towards a theory of frustrated degeneracy. (Q1408874) (← links)
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) (Q1417575) (← links)
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions (Q1569057) (← links)
- On the dimer problem and the Ising problem in finite \(3\)-dimensional lattices (Q1608298) (← links)
- Binary linear codes, dimers and hypermatrices (Q1687777) (← links)
- Binary linear codes via 4D discrete Ihara-Selberg function (Q1733566) (← links)
- Triangles in random graphs (Q1763352) (← links)
- The Edmonds-Gallai decomposition for the \(k\)-piece packing problem (Q1773199) (← links)
- The complexity of computing the Tutte polynomial on transversal matroids (Q1842565) (← links)
- Ground state incongruence in 2D spin glasses revisited (Q1883653) (← links)
- Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries (Q1894008) (← links)
- On paving matroids and a generalization of MDS codes (Q1894376) (← links)
