( en | de | ru )

 

Disambiguation of "Erdös, Péter L."

Author of the publication

copydeleteadd this publication to your clipboard
Regular families of forests, antichains and duality pairs of relational structures.

, , , and . Combinatorica, 37 (4): 651-672 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Erwin Erdös

Georg Erdös

György Erdös

Gabor Erdös

Adorján Miklós Erdös

 

Other publications of authors with the same name

Balanced vertices in trees and a simpler algorithm to compute the genomic distance., , and . Appl. Math. Lett., 24 (1): 82-86 (2011)Subwords in reverse-complement order., , , and . Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, volume 06201 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)Efficient Reconstruction of RC-Equivalent Strings., , and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 349-362. Springer, (2010)Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets., , and . Combinatorica, 20 (1): 27-45 (2000)The mixing time of the swap (switch) Markov chains: a unified approach., , , , , and . CoRR, (2019)A Finite Word Poset., , and . Electron. J. Comb., (2001)Towards Random Uniform Sampling of Bipartite Graphs with given Degree Sequence., , and . Electron. J. Comb., 20 (1): 16 (2013)Fully graphic degree sequences and P-stable degree sequences., , and . CoRR, (2024)On Realizations of a Joint Degree Matrix, , , and . CoRR, (2013)Constructing Big Trees from Short Sequences., , , and . ICALP, volume 1256 of Lecture Notes in Computer Science, page 827-837. Springer, (1997)