We introduce a novel technique to give bounds to the entangled value of non-local games. The technique is based on a class of graphs used by Cabello, Severini and Winter in 2010. The upper bound uses the famous Lovász theta number and is efficiently computable; the lower one is based on the quantum independence number, which is a quantity used in the study of entanglementassisted channel capaci...

A biased graph consists of a graph G together with a collection of distinguished cycles of G, called balanced, with the property that no theta subgraph contains exactly two balanced cycles. Perhaps the most natural biased graphs on G arise from orienting G and then labelling the edges of G with elements of a group Γ. In this case, we may define a biased graph by declaring a cycle to be balanced...

Alon, Krivelevich and Sudakov (Random Structures and Algorithms, 1998) designed an algorithm based on spectral techniques that almost surely nds a clique of size (p n) hidden in an otherwise random graph. We show that a diierent algorithm, based on the Lovv asz theta function, almost surely both nds the hidden clique and certiies its optimality. Our algorithm has an additional advantage of bein...

This paper discusses several alternatives, based on graph search, to calculate UAV trajectories that avoid regions with dangerous weather effects and with the least deviation from the shortest trajectory. It is also explained how to adapt graph search algorithms to be used for 3D trajectories with UAVs, and which design considerations should be taken into account (for example the discretization...

A biased graph consists of a graph T and a subclass B of the polygons of T, such that no theta subgraph of T contains exactly two members of B. A subgraph is balanced when all its polygons belong to B. A vertex is a balancing vertex if deleting it leaves a balanced graph. We give a construction for unbalanced biased graphs having a balancing vertex and we show that an unbalanced biased graph ha...

We study a function on graphs, denoted by Gamma , representing vectorially the domination number of a graph, in a way similar to that in which the Lovász Theta function represents the independence number of a graph. This function is a lower bound on the homological connectivity of the independence complex of the graph, and hence is of value in studying matching problems by topological methods. ...

Although it has been hypothesized that neural oscillations synchronize to mediate memory formation, direct evidence linking oscillatory phase-synchrony to successful memory encoding is limited. Using electrocorticography (ECoG) recorded from 68 neurosurgical patients participating in a free recall task, we compared phase-synchrony and spectral power during successful versus unsuccessful encodin...

To study the differences in functional brain networks between eyes-closed (EC) and eyes-open (EO) at resting state, electroencephalographic (EEG) activity was recorded in 21 normal adults during EC and EO states. The synchronization likelihood (SL) was applied to measure correlations between all pairwise EEG channels, and then the SL matrices were converted to graphs by thresholding. Graphs wer...

amonge other things we give sufficient and necessary conditions for the lau product of banachalgebras to be biflat or biprojective.