1 citations · 1 across the 4 of their papers we have counts for
5 papers
Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
Marcos Kiwi, Martin Loebl
We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size…
Chromatic Polynomial, Colered Jones Function and q-Binomial Counting
Martin Loebl
We define a q-chromatic function on graphs, list some of its properties and provide some formulas in the class of general chordal graphs. Then we relate the q-chromatic function to…
Ground State Incongruence In 2D Spin Glasses Revisited
M. Loebl
A construction supporting a conjecture that different ground state pairs exist in the 2-dimensional Edwards-Anderson Ising spin glass is presented.
Expected length of the longest common subsequence for large alphabets
Marcos Kiwi, Martin Loebl, Jiri Matousek
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…
Random walks and the colored Jones function
Stavros Garoufalidis, Martin Loebl
It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level…