scholarly journals Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs

2017 ◽  
Vol 52 (1) ◽  
pp. 3-40 ◽  
Author(s):  
Mathias Schacht ◽  
Fabian Schulenburg
Keyword(s):  
Bipartite Graphs ◽  
Sharp Thresholds

Bipartite Graphs and their Applications

1998 ◽  
Author(s):  
Armen S. Asratian ◽  
Tristan M. J. Denley ◽  
Roland Häggkvist
Keyword(s):  
Bipartite Graphs

Counting Unlabeled Bipartite Graphs Using Polya's Theorem

2018 ◽  
Vol 25 (5) ◽  
pp. 699-715
Author(s):  
Abdullah Atmaca ◽  
A. Yavuz Oruç
Keyword(s):  
Bipartite Graphs ◽  
Polya's Theorem ◽  
Pólya’S Theorem

Hurricane in Bipartite Graphs: The Lethal Nodes of Butterflies

2020 ◽  
Author(s):  
Qiuyu Zhu ◽  
Jiahong Zheng ◽  
Hao Yang ◽  
Chen Chen ◽  
Xiaoyang Wang ◽  
...  
Keyword(s):  
Bipartite Graphs

Web service discovery based on maximum weighted bipartite graphs

2021 ◽  
Vol 171 ◽  
pp. 54-60
Author(s):  
Kuo Chen ◽  
Cuiping Kuang
Keyword(s):  
Web Service ◽  
Service Discovery ◽  
Bipartite Graphs ◽  
Web Service Discovery

scholarly journals Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs

2021 ◽  
Author(s):  
Lu Chen ◽  
Chengfei Liu ◽  
Rui Zhou ◽  
Jiajie Xu ◽  
Jianxin Li
Keyword(s):  
Bipartite Graphs ◽  
Exact Algorithms

scholarly journals Sharp thresholds of blow-up and global existence for the Schrödinger equation with combined power-type and Choquard-type nonlinearities

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Yongbin Wang ◽  
Binhua Feng
Keyword(s):  
Global Existence ◽  
Finite Time ◽  
Critical Case ◽  
Blow Up ◽  
Critical Mass ◽  
Choquard Equation ◽  
Power Type ◽  
Scale Invariant ◽  
Nonlinear Schrödinger ◽  
Sharp Thresholds

AbstractIn this paper, we consider the sharp thresholds of blow-up and global existence for the nonlinear Schrödinger–Choquard equation $$ i\psi _{t}+\Delta \psi =\lambda _{1} \vert \psi \vert ^{p_{1}}\psi +\lambda _{2}\bigl(I _{\alpha } \ast \vert \psi \vert ^{p_{2}}\bigr) \vert \psi \vert ^{p_{2}-2}\psi . $$iψt+Δψ=λ1|ψ|p1ψ+λ2(Iα∗|ψ|p2)|ψ|p2−2ψ. We derive some finite time blow-up results. Due to the failure of this equation to be scale invariant, we obtain some sharp thresholds of blow-up and global existence by constructing some new estimates. In particular, we prove the global existence for this equation with critical mass in the $L^{2}$L2-critical case. Our obtained results extend and improve some recent results.

Trivalent Non-symmetric Vertex-Transitive Graphs of Order at Most 150

2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang
Keyword(s):  
Automorphism Group ◽  
Bipartite Graphs ◽  
Type Ii ◽  
Symmetric Graph ◽  
Trivalent Graph ◽  
Block Graphs ◽  
Group A ◽  
Vertex Transitive ◽  
Vertex Transitive Graphs ◽  
Transitive Graphs

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.

scholarly journals Cycle partitions of regular graphs

2020 ◽  
pp. 1-24
Author(s):  
Vytautas Gruslys ◽  
Shoham Letzter
Keyword(s):  
Regular Graph ◽  
Bipartite Graphs ◽  
Disjoint Paths ◽  
Regular Graphs ◽  
Simple Construction ◽  
Vertex Set ◽  
Almost All ◽  
Vertex Disjoint

Abstract Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

scholarly journals The Weisfeiler–Leman Dimension of Chordal Bipartite Graphs Without Bipartite Claw

2021 ◽  
Author(s):  
Ilia Ponomarenko ◽  
Grigory Ryabov
Keyword(s):  
Bipartite Graphs ◽  
Chordal Bipartite Graphs
Sign in / Sign up

Export Citation Format

Share Document