Le, TienNam
Overview
Works:  4 works in 4 publications in 2 languages and 6 library holdings 

Roles:  Other, Author 
Classifications:  HD30.4, 510 
Publication Timeline
.
Most widely held works by
TienNam Le
EdgePartitioning a Graph into Paths: Beyond the BarátThomassen Conjecture by
Julien Bensmail(
)
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
Coloring Dense Digraphs by Ararat Harutyunyan(
)
1 edition published in 2019 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2019 in English and held by 2 WorldCat member libraries worldwide
Đề xuất một số giải pháp nâng cao công tác an toàn vệ sinh lao động trong khai thác mỏ lộ thiên của
Công ty cổ phần than Tây Nam Đá Mài  Vinacomin by
Tiến Nam Lê(
)
1 edition published in 2013 in Vietnamese and held by 1 WorldCat member library worldwide
Trình bày cơ sở lý luận về an toàn  vệ sinh lao động trong doanh nghiệp. Phân tích thực trạng hệ thống quản lý công tác an toàn  vệ sinh lao động của Công ty cổ phần than Tây Nam Đá Mài  Vinacomin. Đề xuất một số giải pháp nâng cao công tác an toàn vệ sinh lao động trong khai thác mỏ lộ thiên của Công ty cổ phần than Tây Nam Đá Mài  Vinacomin
1 edition published in 2013 in Vietnamese and held by 1 WorldCat member library worldwide
Trình bày cơ sở lý luận về an toàn  vệ sinh lao động trong doanh nghiệp. Phân tích thực trạng hệ thống quản lý công tác an toàn  vệ sinh lao động của Công ty cổ phần than Tây Nam Đá Mài  Vinacomin. Đề xuất một số giải pháp nâng cao công tác an toàn vệ sinh lao động trong khai thác mỏ lộ thiên của Công ty cổ phần than Tây Nam Đá Mài  Vinacomin
Patterns in Large Graphs by
Tien Nam Le(
)
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
A graph is a set of nodes, together links connecting pairs of nodes. With the accumulating amount of data collected, there is a growing interest in understanding the structures and behavior of very large graphs. Nevertheless, the rapid increasing in size of large graphs makes studying the entire graphs becomes less and less efficient. Thus, there is a compelling demand for more effective methods to study large graphs without requiring the knowledge of the graphs in whole. One promising method to understand the behavior of large graphs is via exploiting specific properties of local structures, such as the size of clusters or the presence locally of some specific pattern, i.e. a given (usually small) graph. A classical example from Graph Theory (proven cases of the ErdosHajnal conjecture) is that if a large graph does not contain some specific pattern, then it must have a set of nodes pairwise linked or not linked of size exponentially larger than expected. This thesis will address some aspects of two fundamental questions in Graph Theory about the presence, abundantly or scarcely, of a given pattern in some large graph:  Can the large graph be partitioned into copies of the pattern?  Does the large graph contain any copy of the pattern?We will discuss some of the most wellknown conjectures in Graph Theory on this topic: the Tutte's flow conjectures on flows in graphs and the ErdosHajnal conjecture mentioned above, and present proofs for several related conjectures  including the BarátThomassen conjecture, a conjecture of Haggkvist and Krissell, a special case of JaegerLinialPayanTarsi's conjecture, a conjecture of Berger et al, and another one by Albouker et al
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
A graph is a set of nodes, together links connecting pairs of nodes. With the accumulating amount of data collected, there is a growing interest in understanding the structures and behavior of very large graphs. Nevertheless, the rapid increasing in size of large graphs makes studying the entire graphs becomes less and less efficient. Thus, there is a compelling demand for more effective methods to study large graphs without requiring the knowledge of the graphs in whole. One promising method to understand the behavior of large graphs is via exploiting specific properties of local structures, such as the size of clusters or the presence locally of some specific pattern, i.e. a given (usually small) graph. A classical example from Graph Theory (proven cases of the ErdosHajnal conjecture) is that if a large graph does not contain some specific pattern, then it must have a set of nodes pairwise linked or not linked of size exponentially larger than expected. This thesis will address some aspects of two fundamental questions in Graph Theory about the presence, abundantly or scarcely, of a given pattern in some large graph:  Can the large graph be partitioned into copies of the pattern?  Does the large graph contain any copy of the pattern?We will discuss some of the most wellknown conjectures in Graph Theory on this topic: the Tutte's flow conjectures on flows in graphs and the ErdosHajnal conjecture mentioned above, and present proofs for several related conjectures  including the BarátThomassen conjecture, a conjecture of Haggkvist and Krissell, a special case of JaegerLinialPayanTarsi's conjecture, a conjecture of Berger et al, and another one by Albouker et al
Audience Level
0 

1  
General  Special 
Related Identities
 Thomassé, Stéphan Other Opponent Thesis advisor
 Harutyunyan, Ararat Other Author
 SpringerLink (Online service) Other
 Bensmail, Julien Author
 Newman, Alantha
 Trần, Thị Bích Ngọc
 Havet, Frédéric (1973....). Other Opponent
 Bonamy, Marthe (1990....). Opponent
 Laboratoire de l'informatique du parallélisme (Lyon) Other
 École doctorale en Informatique et Mathématiques de Lyon Other
Languages