Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.

Kiwi, Marcos; Loebl, Martin

The Electronic Journal of Combinatorics [electronic only] (2008)

  • Volume: 15, Issue: 1, page Research Paper R135, 20 p.-Research Paper R135, 20 p.
  • ISSN: 1077-8926

How to cite

top

Kiwi, Marcos, and Loebl, Martin. "Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.." The Electronic Journal of Combinatorics [electronic only] 15.1 (2008): Research Paper R135, 20 p.-Research Paper R135, 20 p.. <http://eudml.org/doc/117276>.

@article{Kiwi2008,
author = {Kiwi, Marcos, Loebl, Martin},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Gessel's identity; longest increasing sequence; LIS; Ulam's problem; random bipartite graphs; lattice; randomly chosen regular bipartite multigraph; maximum size planar matching; maximum size planar subgraph; combinatorial identities; pattern avoidance},
language = {eng},
number = {1},
pages = {Research Paper R135, 20 p.-Research Paper R135, 20 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.},
url = {http://eudml.org/doc/117276},
volume = {15},
year = {2008},
}

TY - JOUR
AU - Kiwi, Marcos
AU - Loebl, Martin
TI - Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper R135, 20 p.
EP - Research Paper R135, 20 p.
LA - eng
KW - Gessel's identity; longest increasing sequence; LIS; Ulam's problem; random bipartite graphs; lattice; randomly chosen regular bipartite multigraph; maximum size planar matching; maximum size planar subgraph; combinatorial identities; pattern avoidance
UR - http://eudml.org/doc/117276
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.