276 reputation
47
bio website math.uiuc.edu/~puleo
location Urbana, IL
age 27
visits member for 4 years, 6 months
seen 57 mins ago

I have discovered a truly remarkable description of myself that this margin is too small to contain.


2d
awarded  Citizen Patrol
Nov
22
awarded  Critic
Nov
21
awarded  Yearling
Nov
19
comment independent subset problems
(In particular, your problem seems to include 3-dimensional matching as a special case, so it is NP-complete.)
Nov
19
comment independent subset problems
I don't see what purpose the function $f$ serves here. Your problem seems to be equivalent to looking for a matching in the hypergraph with edge set $f(N)$, so why not work with the hypergraph directly?
Nov
13
answered Combinatorial Databases
Nov
3
answered Deciding whether a given graph has an f-factor or not!
Sep
12
awarded  Supporter
Aug
29
awarded  Necromancer
Aug
29
awarded  Revival
Aug
25
comment What is the correct statement of this Erdös-Gallai-Tuza problem generalizing Turan's triangle theorem?
@darijgrinberg: Thanks for your comments! Point taken regarding (1). As far as Lemma 2.1 goes, nothing is really gained by allowing S to be empty or to be all of V(G) (this only yields f_1(G) <= f_1(G) ). It seems a hair simpler to just keep the same hypothesis as Corollary 2.2, where the condition really is needed.
Aug
25
answered What is the correct statement of this Erdös-Gallai-Tuza problem generalizing Turan's triangle theorem?
Mar
31
awarded  Good Answer
Nov
30
awarded  Nice Answer
Sep
29
awarded  Teacher
Sep
29
answered Ingenuity in mathematics
Jul
21
awarded  Enthusiast
May
26
awarded  Autobiographer