Graph-theoretical methods in general function theory

DOI10.1016/S1631-073X(02)02585-2MaRDI QIDQ1565884zbMATH OpenOpenAlexFDO

Authors Amine El Sahili

Publication date 27 May 2003

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1631-073x(02)02585-2

zbMATH Keywords

mapscountable partitionlemma of Erdős

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Other classical set theory (including functions, relations, and set algebra) (03E20)

Recommendations

• scientific article; zbMATH DE number 702025
• Functions and line digraphs
• On Some Applications of Graph Theory III
• On rational functions with disjoint graphs
• Functions that never agree

Cites work

• scientific article; zbMATH DE number 702025 (Why is no real title available?)
• scientific article; zbMATH DE number 3262991 (Why is no real title available?)
• On some extremal problems in graph theory

Cited in

(8)

• On Some Applications of Graph Theory III
• On Gibson functions with connected graphs
• A computational model for generic graph functions
• A functional approach to the representation of graphs
• scientific article; zbMATH DE number 4139789 (Why is no real title available?)
• Generalized homomorphism graph functions
• Functions and line digraphs
• On three blocks paths \(P (k, l, r)\)

This page was built for publication: Graph-theoretical methods in general function theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1565884)