270 citations
- Institute for Solid State Physics and OpticsHU22 papers
- Hungarian Academy of SciencesHU19 papers
- Center for Astrophysics Harvard & SmithsonianUS15 papers
- Konkoly ObservatoryHU15 papers
- The University of SydneyAU14 papers
- Eötvös Loránd UniversityHU13 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- University of ArizonaUS10 papers
- University of AntwerpBE9 papers
- Institute for Particle and Nuclear PhysicsHU8 papers
- London South Bank UniversityGB8 papers
- Max Planck Institute for Radio AstronomyDE8 papers
12 papers · 1 filter
On the structure of graphs with path-width at most two
János Barát, Péter Hajnal, Yixun Lin +1
Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs.…
Elementary proof techniques for the maximum number of islands
János Barát, Péter Hajnal, Eszter K. Horváth
Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamenta…
Disordered Potts model on the diamond hierarchical lattice: Numerically exact treatment in the large-q limit
Ferenc Igloi, Loic Turban
We consider the critical behavior of the random q-state Potts model in the large-q limit with different types of disorder leading to either the nonfrustrated random ferromagnet reg…
Longest convex chains
Gergely Ambrus, Imre Barany
Assume is a random sample of uniform, independent points from a triangle . The longest convex chain, , of is defined naturally. The length of is a r…
Mass Outflow from Red Giant Stars in M13, M15, and M92
Sz. Mészáros, E. H. Avrett, A. K. Dupree
Chromospheric model calculations of the Halpha line for selected red giant branch (RGB) and asymptotic giant branch (AGB) stars in the globular clusters M13, M15, and M92 are const…
Finding bipartite subgraphs efficiently
D. Mubayi, G. Turan
Polynomial algorithms are given for the following two problems: given a graph with vertices and edges, where , find a complete balanced bipartite subgraph…