2,258 reputation
1719
bio website web.mat.bham.ac.uk/~barberba
location Birmingham, UK
age
visits member for 2 years, 11 months
seen 10 hours ago

Postdoc in Birmingham with Daniela Kühn.


10h
reviewed Approve Collapsing the cardinals between two singular cardinals
11h
reviewed No Action Needed How do powers affect asymptotics in generating functions?
18h
reviewed Reviewed I would like to study Industrial Mathematics but needs to know it importance for project managers and the the development of third world countries
1d
reviewed Reviewed Maximal opening angle of a polygon from a point
1d
comment Modification of matching
The first thing Sudakov and Vu do is pass to a bipartite subgraph, so the argument just gets slightly easier. The paper is freely available and very accessible, so take a look at what they do.
Jul
24
comment Existence of functions on finite sets with specific propertise
If the first condition is replaced by $f(A) \in L_A$, where $L_A$ is some adversarially chosen set of size $|A|$, then you are asking whether the Johnson graph $J_{N,n}$ has list chromatic number at most $n$.
Jul
24
reviewed Approve Analytical formula for topological degree
Jul
23
reviewed No Action Needed The scheme $y^n = x^{2n}$ for $n$ a rational number
Jul
23
reviewed Approve Reference request : Besov spaces on ubounded domains
Jul
23
reviewed Close Non convex optimization for iterative function
Jul
21
comment Modification of matching
The key point is that you aren't deleting all of $H$, you're just deleting a random subgraph of $H$ of density $p$ (the subgraph that happens to intersect $p$). Everything else is just bookkeeping.
Jul
21
comment “Nice” and “nasty” partitions in graphs
More generally, given examples on $n_1$ vertices and $n_2$ vertices you can find an example on $n_1 + n_2$ vertices by taking a vertex-disjoint union. So it remains only to check whether such graphs exist for small odd $n$.
Jul
21
comment Modification of matching
@CBrosen I've added a slightly more detailed explanation to the main answer.
Jul
21
revised Modification of matching
more detailed explanation
Jul
21
answered “Nice” and “nasty” partitions in graphs
Jul
20
reviewed Looks OK Products of elliptic isometries
Jul
20
comment Modification of matching
Exactly. If you throw away random edges then you're really just choosing a slightly smaller random graph in the first place.
Jul
17
comment Modification of matching
You take a genuinely random graph then pass to some subgraph. Sudakov and Vu say that provided you didn't throw away more than half of the edges at any vertex then you have a perfect matching in what's left. In your case, at each stage you generate a random graph then throw away the edges that have already been used in some matching. You have to check that this isn't more than half of the edges at any vertex, which it won't be if you have yet to use more than half the edges of $K_{n,n}$.
Jul
17
reviewed Approve Is the set of the convolutions of two-point measures dense in the set of all measures?
Jul
16
answered Modification of matching