On the number of permutations arising from a problem in cell-biology.
Dorninger, D., Hule, H. (1991)
Mathematica Pannonica
Similarity:
Displaying similar documents to “On the lower bound of the spectral norm of symmetric random matrices with independent entries.”
On the number of permutations arising from a problem in cell-biology.
Uniform bounds for exponential moment of maximum of a Dyck path.
Khorunzhiy, Oleksiy, Marckert, Jean-François (2009)
Electronic Communications in Probability [electronic only]
Similarity:
A combinatorial derivation with Schröder paths of a determinant representation of Laurent biorthogonal polynomials.
Kamioka, Shuhei (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An easy proof of the limit in the random assignment problem.
Wästlund, Johan (2009)
Electronic Communications in Probability [electronic only]
Similarity:
A bound for the distribution of the hitting time of arbitrary sets by random walk.
Járai, Antal A., Kesten, Harry (2004)
Electronic Communications in Probability [electronic only]
Similarity:
Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matchings avoiding partial patterns and lattice paths.
Jelínek, Vít, Li, Nelson Y., Mansour, Toufik, Yan, Sherry H.F. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Neighbour-distinguishing edge colourings of random regular graphs.
Greenhill, Catherine, Ruciński, Andrzej (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the genus distribution of -dipoles.
Visentin, Terry I., Wieler, Susana W. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
How frequently is a system of 2-linear Boolean equations solvable?
Pittel, Boris, Yeum, Ji-A (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Paths through fixed vertices in edge-colored graphs
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
Similarity:
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...