Thomas Schweser

activity

20152026

most citedMachine Learning in Electronic Quantum Matter Imaging Experiments

166 citations · 167 across the 5 of their papers we have counts for

collaborators

16 papers

cs.RO2026

Towards Agentic Robots: Model, Data, Environment, and Harness

Chonghan Qin, Dongming Wu, Kaituo Feng +13

Foundation models are driving a paradigm shift in robotic intelligence, moving beyond low-level action prediction to goal-directed orchestration of data collection, model training,…

math.CO2026

Intersecting integer partitions: star bounds and counterexamples at every scale

Yury Person, Thomas Schweser

Two integer partitions $t$ -intersect if they have at least $t$ common parts, counted with multiplicity. We study the largest $t$ -intersecting families of integer partitions of $n$ …

math.CO2025

The Tournament Theorem of Rédei revisited

Thomas Schweser, Michael Stiebitz, Bjarne Toft

In 1934 L. Rédei published his famous theorem that the number of Hamiltonian paths in a tournament is odd. In fact it is a corollary of a stronger theorem in his paper. Stronger th…

math.CO2020

Digraphs and variable degeneracy

Jørgen Bang-Jensen, Thomas Schweser, Michael Stiebitz

Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f : V (D) \to N_{0}^{p}$ be a vector function with $f = (f_{1}, f_{2}, \dots, f_{p})$ . We say that $D$ has an $f$ -partition if…

math.CO2020

Point partition numbers: perfect graphs

Justus von Postel, Thomas Schweser, Michael Stiebitz

Graphs considered in this paper are finite, undirected and without loops, but with multiple edges. For an integer $t \geq 1$ , denote by $M G_{t}$ the class of graphs whose ma…

math.CO2019

Point partition numbers: decomposable and indecomposable critical graphs

Justus von Postel, Thomas Schweser, Michael Stiebitz

Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number $χ_{t} (G)$ is the least integer $k$ for which $G$ admits…

math.CO2019

Hajós and Ore constructions for digraphs

Jørgen Bang-Jensen, Thomas Bellitto, Michael Stiebitz +1

The chromatic number $χ (D)$ of a digraph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class induces an acyclic subdig…

math.CO2019

Generalized DP-Colorings of Graphs

Alexandr V. Kostochka, Thomas Schweser, Michael Stiebitz

By a graph we mean a finite undirected graph having multiple edges but no loops. Given a graph property $P$ , a $P$ -coloring of a graph $G$ with color set $C$ is…

math.CO2018

On DP-Coloring of Digraphs

Jørgen Bang-Jensen, Thomas Bellitto, Thomas Schweser +1

DP-coloring is a relatively new coloring concept by Dvořák and Postle and was introduced as an extension of list-colorings of (undirected) graphs. It transforms the problem of find…

cond-mat.dis-nn2018★ 166 cited

Machine Learning in Electronic Quantum Matter Imaging Experiments

Yi Zhang, A. Mesaros, K. Fujita +8

Essentials of the scientific discovery process have remained largely unchanged for centuries: systematic human observation of natural phenomena is used to form hypotheses that, whe…

math.CO2018

Vertex partition of hypergraphs and maximum degenerate subhypergraphs

Thomas Schweser, Michael Stiebitz

In 2007 Matamala proved that if $G$ is a simple graph with maximum degree $Δ \geq 3$ not containing $K_{Δ + 1}$ as a subgraph and $s, t$ are positive integers such that $s + t \geq Δ$ ,…

math.CO2018

Coloring hypergraphs of low connectivity

Thomas Schweser, Michael Stiebitz, Bjarne Toft

For a hypergraph $G$ , let $χ (G), Δ (G),$ and $λ (G)$ denote the chromatic number, the maximum degree, and the maximum local edge connectivity of $G$ , respectively. A result of Rhys P…

math.CO2018

Partitions of hypergraphs under variable degeneracy constraints

Thomas Schweser, Michael Stiebitz

The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given…

math.CO2018

Generalized Hypergraph Coloring

Thomas Schweser

A smooth hypergraph property $P$ is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hyper…

math.CO2017★ 1 cited

Partitions of multigraphs under degree constraints

Thomas Schweser, Michael Stiebitz

In 1996, Michael Stiebitz proved that if $G$ is a simple graph with $δ (G) \geq s + t + 1$ and $s, t \in Z_{\geq 0}$ , then $V (G)$ can be partitioned into two sets $A$ and $B$ such…

math.CO2015

Degree choosable signed graphs

Thomas Schweser, Michael Stiebitz

A signed graph is a graph in which each edge is labeled with $+ 1$ or $- 1$ . A (proper) vertex coloring of a signed graph is a mapping $\f$ that assigns to each vertex $v \in V (G)$ a…