Oriented bipartite graphs and the Goldbach graph

DOI10.1016/j.disc.2021.112497zbMath1473.05104arXiv1611.10259OpenAlexW3166354202MaRDI QIDQ2037582

Sandip Das, Sagnik Sen, Prantar Ghosh, Shamik Ghosh

Publication date: 8 July 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.10259

zbMATH Keywords

bipartite graphprime numberoriented bipartite graphGoldbach conjecturebitournamentbitransitive graph

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Least resolved trees for two-colored best match graphs ⋮ Powers of 2 in two Goldbach-Linnik type problems involving prime cubes ⋮ Quasi-best match graphs ⋮ The structure of 2-colored best match graphs

Cites Work

• Unnamed Item
• Partition of a directed bipartite graph into two directed cycles
• Oriented trees in digraphs
• On the girth of digraphs
• Bounded gaps between primes
• Verifying the Goldbach conjecture up to 4⋅10¹⁴
• Every odd number greater than $1$ is the sum of at most five primes
• Tournaments and Semicomplete Digraphs
• Semicomplete Multipartite Digraphs
• Longest paths and cycles in bipartite oriented graphs
• Classes of Directed Graphs
• Oriented bipartite graphs with minimal trace norm
• Circular‐Arc Bigraphs and Its Subclasses
• Digraphs

This page was built for publication: Oriented bipartite graphs and the Goldbach graph