The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On the number of dissimilar pfaffian orientations of graphs ”

A note on the Size-Ramsey number of long subdivisions of graphs

Jair Donadelli, Penny E. Haxell, Yoshiharu Kohayakawa (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let  be the graph obtained from a given graph  by subdividing each edge  times. Motivated by a problem raised by Igor Pak [Mixing time and long paths in graphs, in (SODA 2002) 321–328], we prove that, for any graph , there exist graphs  with  edges that are Ramsey with respect to  .

Square-root rule of two-dimensional bandwidth problem

Lan Lin, Yixun Lin (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

The bandwidth minimization problem is of significance in network communication and related areas. Let be a graph of vertices. The two-dimensional bandwidth () of is the minimum value of the maximum distance between adjacent vertices when is embedded into an  ×  grid in the plane. As a discrete optimization problem, determining () is NP-hard in general. However, exact results for this parameter can be derived for some special classes of graphs. This...

Central limit theorems for linear spectral statistics of large dimensional F-matrices

Shurong Zheng (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

In many applications, one needs to make statistical inference on the parameters defined by the limiting spectral distribution of an matrix, the product of a sample covariance matrix from the independent variable array ( )×1 and the inverse of another covariance matrix from the independent variable array ( )×2. Here, the two variable arrays are assumed to either both real or both complex. It helps to find the asymptotic distribution of the relevant parameter...