Skip to main content
Thomas Benjamin's user avatar
Thomas Benjamin's user avatar
Thomas Benjamin's user avatar
Thomas Benjamin
  • Member for 12 years, 11 months
  • Last seen this week
awarded
comment
What is the weakest subsystem of Second-order Arithmetic (or its first-order part) that proves Szemerédi's Regularity Lemma?
@EmilJeřábek: How ( for example) would you represent the simplest hamiltonian graph (a triangle--three vertices and three edges) by numbers?
comment
What is the weakest subsystem of Second-order Arithmetic (or its first-order part) that proves Szemerédi's Regularity Lemma?
@EmilJeřábek: Can you then characterize all finite hamiltonian graphs by this numbering?
comment
What is the weakest subsystem of Second-order Arithmetic (or its first-order part) that proves Szemerédi's Regularity Lemma?
@EmilJeřábek: for a Hamiltonian graph, would the property that makes that graph Hamiltonian also be able to be expressed as a first-order arithmetical statement?
Loading…
revised
Loading…
reviewed
Leave Open
1
3 4
5
6 7
70