User talk:SofjaKovalevskaja

Welcome![edit]

Hello, SofjaKovalevskaja, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few links to pages you might find helpful:

Please remember to sign your messages on talk pages by typing four tildes (~~~~); this will automatically insert your username and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or ask your question on this page and then place {{Help me}} before the question. Again, welcome! — Ascii002 ^{Let's talk!} 15:24, 2 July 2014 (UTC)[reply]

Hello, I'm Materialscientist. I noticed that you recently removed some content without explaining why. In the future, it would be helpful to others if you described your changes to Wikipedia with an accurate edit summary. If this was a mistake, don't worry; I restored the removed content. If you would like to experiment, please use the sandbox. If you think I made a mistake, or if you have any questions, you can leave me a message on my talk page. Thanks! Materialscientist (talk) 09:28, 15 July 2014 (UTC)[reply]

article "Bipartite realization problem"[edit]

I just went through the above article that you created.

In the text there are two small issues that you may wish to consider:

1./ While you referred to the last paper properly, the listing of this paper is not correct: Istvan Miklos is the first author of this article, I'm just the second.

2./ In connection of the FPTAS property: it is true that both the Kannan's algorithm for regular bipartite graphs, and our result on half-regular bipartite graphs are in FPTAS, however this property was not proved in those papers, but in the following paper: P.L. Erd\H{o}s - S.Z. Kiss - I. Mikl\'{o}s - L. Soukup: Constructing, sampling and counting graphical realizations of restricted degree sequences, {\sl arXiv} {\bf 1301.7523} (2013), 1--24.

As a matter of fact the FPTAS property was also proved there for sampling regular directed graphs (a very nice result of Catherine Greenhill: A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs, {\sl Elec. J. Combinatorics} {\bf 18} (2011), \#P234.) since it can be considered as a result for regular bipartite graphs with a forbidden one factor, therefore the result of the EKMS's paper also applies for that case.

Best regards

Peter Erdos erdos.peter@renyi.mta.hu 84.0.103.220 (talk) 15:51, 20 July 2014 (UTC)[reply]

Sources for Bipartite realization algorithm[edit]

Hi SofjaKovalevskaja,

Could you please add some appropriate references to this article? The remark that "It was never been published in a scientific paper" makes me kind of nervous because right now the page looks like it's presenting original research.

TIA,
QVVERTYVS (hm?) 08:17, 24 July 2014 (UTC)[reply]

Nomination of Bipartite realization algorithm for deletion[edit]

A discussion is taking place as to whether the article Bipartite realization algorithm is suitable for inclusion in Wikipedia according to Wikipedia's policies and guidelines or whether it should be deleted.

The article will be discussed at Wikipedia:Articles for deletion/Bipartite realization algorithm until a consensus is reached, and anyone is welcome to contribute to the discussion. The nomination will explain the policies and guidelines which are of concern. The discussion focuses on high-quality evidence and our policies and guidelines.

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article. QVVERTYVS (hm?) 09:11, 25 July 2014 (UTC)[reply]