|
SAKUMA Tadashi
|
Research Areas 【 display / non-display 】
-
Natural Science / Basic mathematics
Graduating School 【 display / non-display 】
-
The University of Tokyo, Faculty of Liberal Arts
1992.03, Graduated
Graduate School 【 display / non-display 】
-
The University of Tokyo, Graduate School, Division of General Culture, Systems Science, General Systems Studies, Department of Graphics and Computer Sciences
Master's Course, 1994.03, Completed
-
The University of Tokyo, Graduate School, Division of General Culture, Systems Science, General Systems Studies, Department of Graphics and Computer Sciences
Doctor's Course, 1997.03, Completed
External Career 【 display / non-display 】
-
Department of Advanced Social and International Studies, Graduate School of Arts and Sciences, The University of Tokyo, Research Assistant, 2000.05 - 2005.03
Academic Society Affiliations 【 display / non-display 】
-
The Operations Research Society of Japan
-
The Mathematical Society of Japan
Papers 【 display / non-display 】
-
On the average hitting times of the squares of cycles, Discrete Applied Mathematics, 313 18-28, 2022.05
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota
Multiple Authorship (Only Japanese)
-
Tutte polynomial, complete invariant, and theta series, Graphs and Combinatorics, 37 1545-1558, 2021.10
Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma, Hidehiro Shinohara
Multiple Authorship (Only Japanese)
-
Pebble exchange group of graphs, European Journal of Combinatorics, 95(103325) , 2021.06
Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma
Multiple Authorship (Only Japanese)
-
Stable structure on safe set problems in vertex-weighted graphs, European Journal of Combinatorics, 91 , 2021.01
Shinya Fujita, Boram Park, Tadashi Sakuma
Multiple Authorship (Including Foreigners)
-
Stable Structure on Safe Set Problems in Vertex-weighted Graphs II -- Recognition and Complexity -- (In: Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers), Lecture Notes in Computer Science, 12301 364-375, 2020.10
Shinya Fujita, Boram Park and Tadashi Sakuma
Multiple Authorship (Including Foreigners)
Books 【 display / non-display 】
Grant-in-Aid for Scientific Research 【 display / non-display 】
-
Grant-in-Aid for Scientific Research(C),2022.04 - 2026.03
-
Grant-in-Aid for Scientific Research(C),2018.04 - 2022.03
-
Grant-in-Aid for Scientific Research(C),2018.04 - 2019.03
-
Grant-in-Aid for Scientific Research(C),2014.04 - 2018.03,Research on similarity between blocking-type and anti-blocking-type polyhedra
-
Grant-in-Aid for Scientific Research(C),2007.04 - 2011.03
Presentations 【 display / non-display 】
-
International Symposium on Computational Operations Research and Algorithmic Game Theory , International presentation, 2021.03, Network majority and the connected safe set problem, Oral presentation (invited, special)
-
2017 Symposium on Mathematical Programming and Game Theory (2017 SMPGT), International presentation, 2017.01, Similarities and dissimilarities between the blocking and anti-blocking polyhedra, Oral presentation (invited, special)
-
Mathematical Society of Japan 2016 Annual Meeting Talk Invited by Applied Mathematics Section, Domestic presentation, 2016.03, Similarities and dissimilarities between the blocking and anti-blocking polyhedra, Oral presentation (invited, special)
Academic Activity 【 display / non-display 】
-
Zentralblatt MATH (zbMATH), 2012.05 -
-
Mathematical Reviews (MathSciNet), 2012.05 -
-
The Mathematical Society of Japan, 2020.04 - 2021.04
-
The Mathematical Society of Japan, 2021.04 - 2022.04
-
The Mathematical Society of Japan, 2021.10 - 2023.09
Recommended URL 【 display / non-display 】
-
PERFECT PAPERS
http://users.encs.concordia.ca/~chvatal/perfect/papers.html
Here is a bibliography of selected papers on perfect graphs.
Science and Technology in General
-
PERFECT PROBLEMS
http://users.encs.concordia.ca/~chvatal/perfect/problems.html
Science and Technology in General
-
Perfect Graphs
http://www.aimath.org/WWN/perfectgraph/
This web page highlights some of the conjectures and open problems concerning Perfect Graphs.
Science and Technology in General
-
Bold Conjecture (Wolfram MathWorld)
http://mathworld.wolfram.com/BoldConjecture.html
Bold Conjecture
A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) is the clique number of H. The omega-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S meets every omega-clique of G, and omega-critical pairs within S form a connected graph.
In 1993, G. Bacsó conjectured that if G is a uniquely omega-colorable perfect graph, then G has at least one forced color class. This conjecture is called the bold conjecture, and implies the strong perfect graph theorem. However, a counterexample of the conjecture was subsequently found by Sakuma (1997).Science and Technology in General