◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Tarsi

4 papers hereh-index 252.5k citations46 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • last author3

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.CO3
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20082018
most citedFlows and bisections in cubic graphs

15 citations · 23 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2018

Bounded-Excess Flows in Cubic Graphs

Michael Tarsi

An (r,alpha)-bounded excess flow ((r,alpha)-flow) in an orientation of a graph G=(V,E) is an assignment of a real "flow value" between 1 and r-1 to every edge. Rather than 0 as in…

math.CO2015★ 15 cited

Flows and bisections in cubic graphs

Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi

A k-weak bisection of a cubic graph G is a partition of the vertex-set of G into two parts V1​ and V2​ of equal size, such that each connected component of the subgraph o…

math.CO2015★ 1 cited

The structure of graphs with Circular flow number 5 or more, and the complexity of their recognition problem

Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi

For some time the Petersen graph has been the only known Snark with circular flow number 5 (or more, as long as the assertion of Tutte's 5-flow Conjecture is in doubt). Althoug…

cs.DM2008★ 7 cited

Some results on (a:b)-choosability

Shai Gutner, Michael Tarsi

A solution to a problem of Erdős, Rubin and Taylor is obtained by showing that if a graph G is (a:b)-choosable, and c/d>a/b, then G is not necessarily (c:d)-choosable.…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.