Profile Activity

András Salamon

Meta user

Network profile

Reputation

2,100

2.1k
1.9k
1.8k

2016
2017
2018
2019

Top tag

graph-theory

Next privilege

2,500 Rep.

Create tag synonyms

Badges

Newest

Next badge

17/30

Impact

8 posts edited

2 helpful flags

1,865 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

17 Questions

Views Newest Activity Votes

votes

answers

views

Are nontrivial integer solutions known for $x^3+y^3+z^3=3$?

Sep 9 at 13:31 David Roberts 25.2k

votes

answers

views

Is #k-XORSAT #P-complete?

computational-complexity

Apr 5 '11 at 10:44 András Salamon 2,100

votes

answer

views

Weakest choice principle required for Robertson-Seymour Graph Minor Theorem?

reverse-math lo.logic set-theory axiom-of-choice graph-theory

Apr 30 '13 at 12:04 Community♦ 1

votes

answers

927

views

In Szemerédi's Regularity Lemma, how many blocks are in the partition?

reference-request co.combinatorics

Apr 12 '14 at 20:41 Jacob Fox 646

votes

answer

342

views

Number of median graphs?

co.combinatorics graph-theory enumerative-combinatorics

Apr 14 at 14:41 Martin Sleziak 3,910

votes

answers

286

views

Universal anti-Horn classes?

reference-request lo.logic model-theory universal-algebra

Apr 23 '15 at 12:05 András Salamon 2,100

votes

answer

407

views

Name for this generalized pigeonhole principle?

reference-request set-theory axiom-of-choice partitions

Nov 26 '12 at 0:10 François G. Dorais♦ 39.8k

votes

answers

302

views

Stable distributions for Lindeberg exchange strategy?

pr.probability universal-property random-matrices asymptotics

Feb 11 '11 at 18:47 András Salamon 2,100

votes

answers

411

views

Better bounds for exact-intersection Erdős–Ko–Rado system?

reference-request co.combinatorics extremal-combinatorics

May 12 '14 at 13:57 Community♦ 1

votes

answer

875

views

Simple lower bounds for Bell numbers (number of set partitions)?

co.combinatorics lower-bounds asymptotics

Dec 28 '12 at 14:22 Community♦ 1

votes

answers

171

views

largest diameter of intersection of two balls

reference-request mg.metric-geometry computational-geometry metric-spaces

Oct 25 '18 at 3:25 Gabe K 1,340

votes

answer

222

views

Do right-profiles determine graphs up to isomorphism?

graph-theory graph-polynomials reference-request co.combinatorics algebraic-graph-theory

Jul 13 '16 at 0:32 Community♦ 1

votes

answers

views

Survey of finite axiomatizability for relational theories?

lo.logic model-theory axioms reference-request universal-algebra

Oct 25 '12 at 15:44 Community♦ 1

votes

answer

609

views

Higher-order preservation theorems?

model-theory lo.logic universal-algebra

Jun 16 '11 at 18:25 Ali Enayat 11.5k

votes

answer

119

views

Is quasivariety generated by all perfect graphs finitely axiomatizable?

lo.logic model-theory universal-algebra

Jul 16 '14 at 10:50 András Salamon 2,100

votes

answer

views

Efficiently embedding finite Boolean algebras into lattices of set partitions?

order-theory lattice-theory boolean-algebras

May 2 at 18:19 Daniele Tampieri 932

votes

answer

239

views

A Ramsey-like lower bound?

co.combinatorics ramsey-theory graph-theory graph-colorings

Jul 10 '12 at 21:06 James Cranch 2,824

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

17 Questions

Are nontrivial integer solutions known for $x^3+y^3+z^3=3$?

Is #k-XORSAT #P-complete?

Weakest choice principle required for Robertson-Seymour Graph Minor Theorem?

In Szemerédi's Regularity Lemma, how many blocks are in the partition?

Number of median graphs?

Universal anti-Horn classes?

Name for this generalized pigeonhole principle?

Stable distributions for Lindeberg exchange strategy?

Better bounds for exact-intersection Erdős–Ko–Rado system?

Simple lower bounds for Bell numbers (number of set partitions)?

largest diameter of intersection of two balls

Do right-profiles determine graphs up to isomorphism?

Survey of finite axiomatizability for relational theories?

Higher-order preservation theorems?

Is quasivariety generated by all perfect graphs finitely axiomatizable?

Efficiently embedding finite Boolean algebras into lattices of set partitions?

A Ramsey-like lower bound?