|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 14 publication records. Showing 14 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Lale Özkahya, Yury Person |
Minimum H-decompositions of graphs: Edge-critical case.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Roman Glebov, Yury Person, Wilma Weps |
On extremal hypergraphs for Hamiltonian cycles. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht |
Weak quasi-randomness for uniform hypergraphs. |
Random Struct. Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Axenovich, Yury Person, Svetlana Puzynina |
A regularity lemma and twins in words |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Hiêp Hàn, Yury Person, Mathias Schacht |
Note on forcing pairs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Gugelmann, Yury Person, Angelika Steger, Henning Thomas |
A Randomized Version of Ramsey's Theorem. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roman Glebov, Yury Person, Wilma Weps |
On Extremal Hypergraphs for Hamiltonian Cycles. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Person, Mathias Schacht |
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. |
Discrete Mathematics & Theoretical Computer Science |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hiêp Hàn, Yury Person, Mathias Schacht |
Note on strong refutation algorithms for random k-SAT formulas. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Person, Mathias Schacht |
An expected polynomial time algorithm for coloring 2-colorable 3-graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry Liu, Yury Person |
Highly connected coloured subgraphs via the regularity lemma. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht |
On Colourings of Hypergraphs Without Monochromatic Fano Planes. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiêp Hàn, Yury Person, Mathias Schacht |
On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Person, Mathias Schacht |
Almost all hypergraphs without Fano planes are bipartite. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #14 of 14 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")