Zapiski Nauchnykh Seminarov POMI
RUS
ENG
JOURNALS
PEOPLE
ORGANISATIONS
CONFERENCES
SEMINARS
VIDEO LIBRARY
PACKAGE AMSBIB
JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
General information
Latest issue
Archive
Impact factor
Search papers
Search references
RSS
Latest issue
Current issues
Archive issues
What is RSS
Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find
Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register
2006, Volume 340
|
General information
|
Contents
|
Combinatorics and graph theory. Part I
Helly's property for
$n$
-cliques and the degree of a graph
S. L. Berlov
5–9
Lower bounds of static Lovász–Schrijver calculus proofs for Tseitin tautologies
D. M. Itsykson, A. A. Kojevnikov
10–32
Vertex cuts in a
$k$
-connected graph
D. V. Karpov
33–60
Potential theory for mean payoff games
Yu. M. Lifshits, D. S. Pavlov
61–75
Cliques in
$k$
-connected graphs
S. A. Obraztsova
76–86
On amorphic
$C$
-algebras
I. N. Ponomarenko, A. Rahnamai Barghi
87–102
Removing vertices from
$k$
-connected graphs without losing
$k$
-connectivity
A. S. Chukhnov
103–116
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2024