current community
chat
blog
MathOverflow
MathOverflow Meta
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
Stack Exchange
sign up
log in
tour
help
Tour
Start here for a quick overview of the site
Help Center
Detailed answers to any questions you might have
Meta
Discuss the workings and policies of this site
MathOverflow
Questions
Tags
Users
Badges
Unanswered
Ask Question
Jan Kyncl
less info
meta user

network profile
1,706
reputation
4
13
bio
website
location
age
visits
member for
2 years, 11 months
seen
3 hours ago
stats
profile views
273
1,706
reputation
bio
website
visits
member for
2 years, 11 months
4
13
badges
location
seen
3 hours ago
summary
answers
questions
tags
badges
favorites
bounties
reputation
all actions
118
Actions
suggestions
reviews
revisions
comments
badges
posts
accepts
all
Apr
16
answered
Reference request: monochromatic paths in edgecolored complete graphs
Apr
15
comment
Reference request: monochromatic paths in edgecolored complete graphs
I think these results would be for paths with $k$ vertices; the question is about paths of length $k$, so $k+1$ vertices.
Apr
11
awarded
Nice Answer
Apr
11
answered
Can any simplex shadowproject to a regular simplex?
Apr
9
revised
How many unit simplices are needed to cover a unit $n$cube?
added 389 characters in body
Apr
9
answered
How many unit simplices are needed to cover a unit $n$cube?
Apr
9
comment
How many unit simplices are needed to cover a unit $n$cube?
I asked the latter question here:
mathoverflow.net/questions/139161/…
.
Nov
12
awarded
Nice Answer
Nov
12
revised
Do there exist sparse graphs with large crossing number?
corrected constants
Oct
30
revised
Are angles between points enough to decide the realizability?
added 17 characters in body
Oct
30
answered
Are angles between points enough to decide the realizability?
Oct
4
revised
open question on intersecting rectangles  reference request
corrected a name
Oct
3
comment
open question on intersecting rectangles  reference request
I agree with bof, the inequalities should probably be $c\sqrt{n}/{\log n} \le m \le \sqrt n$.
Oct
3
answered
open question on intersecting rectangles  reference request
Oct
2
revised
Do there exist sparse graphs with large crossing number?
added a note about random graphs
Oct
2
answered
Do there exist sparse graphs with large crossing number?
Sep
21
revised
Trees with a maximal convex hull: are the only optimal solutions Steiner trees?
added 342 characters in body
Sep
21
answered
Square filling self avoiding walk
Sep
21
answered
Trees with a maximal convex hull: are the only optimal solutions Steiner trees?
Jul
19
comment
Vertex transitive and edge transitive and line graph
$G=K_3+K_{1,3}$ is a counterexample. The linegraph of $G$ is vertex transitive but $G$ is not edge transitive.
MathOverflow works best with JavaScript enabled