Thomas Kalinowski

709

Reputation

1090 views

Registered User

Name	Thomas Kalinowski
Member for	2 years
Seen	2 mins ago
Website	math.uni-rostock.de/~kalinowski
Location	Rostock, Germany
Age	32

stats recent reputation favorites

5

Questions

votes newest views recent

1

7

votes

1

answer

325

views

Graphs with many triangles but few complete graphs on 4 vertices

co.combinatorics graph-theory extremal-graph-theory

feb 2 11 at 1:55 David Eppstein 9,233●1●21●41

2

3

votes

0

answers

250

views

An extremal problem for graphs having every edge contained in a 4-clique

graph-theory extremal-graph-theory co.combinatorics

mar 11 11 at 4:40 Thomas Kalinowski 709●4●7

2

votes

0

answers

69

views

Incremental minimum spanning tree

graph-theory reference-request oc.optimization-control matroid-theory

may 4 at 12:48 Thomas Kalinowski 709●4●7

1

vote

1

answer

131

views

Covering max flow arcs by arc disjoint paths

oc.optimization-control graph-theory linear-optimization

jun 25 at 21:24 Thomas Kalinowski 709●4●7

0

votes

0

answers

33

views

Approximation for accumulative set cover

approximation-algorithms computational-complexity combinatorial-optimizatio

mar 30 at 11:47 Thomas Kalinowski 709●4●7

16

Answers

votes newest views recent

Modern Mathematical Achievements Accessible to Undergraduates

Is there a simple test to determine whether a polytope is integral?

Is this graph well known?

Clique weight-optimal matchings on n-partite graphs.

Degree reduction argument in Guth-Katz’sproof of Erdos distinct distance problem in the plane

Low rate c-uniform pairwise intersecting set systems (2)

How to compute the closure of a set of binary strings in term of the “AND” and “OR” operators?

(Heuristic for) Partitioning n-partite weighted graphs into bounded n-cliques

Sylow theorems for infinite groups

Proof of the clique-number for random graphs: How to bound this binomial-like expression?

Interesting and Accessible Topics in Graph Theory

Official name and complexity of k-way balanced set partitioning? What is the best heuristic?

Maximum flow with negative capacities?

Probability of having a threshold number of unique elements in each of ‘S’ multisets constructed by sampling with uniform probability from the same set

Covering max flow arcs by arc disjoint paths

Finding the lowest cost set of disjoint paths using all nodes in a directed graph?

468

Votes

459

9

24

Tags

11

Badges

● Yearling× 2
● Civic Duty
● Commentator

● Critic
● Enthusiast
● Teacher

● Editor
● Scholar
● Supporter