French UserGuide.lyx: another update from Jean-Pierre

[lyx.git] / lib / examples / beamerlyxexample1.lyx

diff --git a/lib/examples/beamerlyxexample1.lyx b/lib/examples/beamerlyxexample1.lyx
index b4ee35edf3ae499f0f25da244d8ef1e5351d760b..f595947dedf296f3aa5be2cead5cf40a4ac6c3f2 100644 (file)
--- a/lib/examples/beamerlyxexample1.lyx
+++ b/lib/examples/beamerlyxexample1.lyx
@@ -1,7 +1,9 @@
-#LyX 2.1 created this file. For more info see http://www.lyx.org/
-\lyxformat 474
+#LyX 2.2 created this file. For more info see http://www.lyx.org/
+\lyxformat 506
 \begin_document
 \begin_header
+\save_transient_properties true
+\origin /systemlyxdir/examples/
 \textclass beamer
 \begin_preamble
 \beamertemplateshadingbackground{red!5}{structure!5}
@@ -155,16 +157,16 @@
 \language_package default
 \inputencoding auto
 \fontencoding global
-\font_roman times
-\font_sans default
-\font_typewriter default
-\font_math auto
+\font_roman "times" "default"
+\font_sans "default" "default"
+\font_typewriter "default" "default"
+\font_math "auto" "auto"
 \font_default_family default
 \use_non_tex_fonts false
 \font_sc false
 \font_osf false
-\font_sf_scale 100
-\font_tt_scale 100
+\font_sf_scale 100 100
+\font_tt_scale 100 100
 \graphics default
 \default_output_format default
 \output_sync 0
@@ -260,6 +262,10 @@ Outline
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -360,10 +366,17 @@ Tournaments Consist of Jousts Between Knights
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -553,6 +566,10 @@ What is a Tournament?
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -598,7 +615,10 @@ In every joust one knight wins.
 \end_deeper
 \end_deeper
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -613,10 +633,17 @@ Tournaments are Complete Directed Graphs
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
 \begin_layout Columns
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -844,6 +871,10 @@ tournament
  
 \color inherit
 is a
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -862,7 +893,10 @@ any two different vertices.
 \end_deeper
 \end_deeper
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -887,6 +921,10 @@ Tournaments Arise Naturally in Different Situations
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -901,6 +939,10 @@ Applications in Ordering Theory
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -914,7 +956,10 @@ The comparison relation may be cyclic, however.
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -929,6 +974,10 @@ Applications in Sociology
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -942,7 +991,10 @@ Reviewers decide for any two candidates whom they prefer.
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -957,6 +1009,10 @@ Applications in Structural Complexity Theory
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -997,6 +1053,10 @@ status open
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1133,6 +1193,10 @@ the Approximation Problem
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1269,6 +1333,10 @@ status open
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1283,6 +1351,10 @@ t,onlytextwidth
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1356,6 +1428,10 @@ Example Input
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1745,6 +1821,10 @@ Example Output
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1971,6 +2051,10 @@ status open
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -1985,6 +2069,10 @@ Variants of Path Finding Problems
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2200,6 +2288,10 @@ Logspace Turing Machines
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2367,7 +2459,10 @@ end{pgfpicture}
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -2382,6 +2477,10 @@ Logspace Turing Machines Are Quite Powerful
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2396,6 +2495,10 @@ Deterministic logspace machines can compute
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2427,6 +2530,10 @@ Non-deterministic logspace machines can compute
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2444,7 +2551,10 @@ satisfiability with two literals per clause.
 
 \end_deeper
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -2479,6 +2589,10 @@ The Complexity Class Hierarchy
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2866,7 +2980,10 @@ end{pgfpicture}
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -2897,6 +3014,10 @@ Limit the Circuit Depth
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2936,6 +3057,10 @@ t
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2958,6 +3083,10 @@ Circuit Class
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -2974,6 +3103,9 @@ unbounded fan-in
 
 \end_deeper
 \begin_layout Examples
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3016,6 +3148,10 @@ Circuit Class
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3032,6 +3168,9 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3081,6 +3220,10 @@ Circuit Class
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3097,6 +3240,9 @@ bounded fan-in
 
 \end_deeper
 \begin_layout Examples
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3143,6 +3289,10 @@ Are Equally Difficult
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3168,6 +3318,10 @@ Are Equally Difficult
 
 \begin_layout Corollary
 For directed graphs, we can solve
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3233,6 +3387,10 @@ But Not Trivial
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3251,7 +3409,10 @@ But Not Trivial
 -complete.
 \end_layout
 
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3303,6 +3464,10 @@ Definition of the Tournament Reachability Problem
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3324,6 +3489,10 @@ contain all triples
 \end_inset
 
  such that
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3356,7 +3525,10 @@ there exists a path from
 
 \end_deeper
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3371,6 +3543,10 @@ The Tournament Reachability Problem is Very Easy
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3396,6 +3572,10 @@ Implications
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3460,6 +3640,10 @@ the Distance Problem
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3481,6 +3665,10 @@ contain all tuples
 \end_inset
 
  such that 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3517,7 +3705,10 @@ the distance of
 
 \end_deeper
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3532,6 +3723,10 @@ The Tournament Distance Problem is Hard
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3596,7 +3791,10 @@ in logarithmic space, iff
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3615,6 +3813,10 @@ Proof That
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3645,6 +3847,10 @@ t,onlytextwidth
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3689,6 +3895,10 @@ Reduce
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -3756,7 +3966,10 @@ Query:
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -3781,6 +3994,10 @@ status open
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -4936,6 +5153,10 @@ Approximators Compute Paths that Are Nearly As Short As a Shortest Path
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -4953,6 +5174,10 @@ approximation scheme for
  
 \color inherit
 gets as input
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -4998,7 +5223,10 @@ a path from
 
 \end_deeper
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -5017,6 +5245,10 @@ the Tournament Shortest Path Problem
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5098,7 +5330,8 @@ fragile
 \end_inset
 
 .
- LyX has the FragileFrame layout for this.
+ \SpecialChar LyX
+ has the FragileFrame layout for this.
 \end_layout
 
 \end_inset
@@ -5121,6 +5354,10 @@ Just a frame with a program code listing
 
 \begin_layout FragileFrame
 This is some program code:
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5200,6 +5437,10 @@ Summary
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5214,6 +5455,10 @@ Summary
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5283,7 +5528,10 @@ in tournaments is
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -5298,6 +5546,10 @@ Outlook
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5372,6 +5624,10 @@ For Further Reading
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5604,6 +5860,10 @@ Definition of Independence Number of a Graph
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5637,7 +5897,10 @@ Tournaments have independence number 1.
 \end_layout
 
 \end_deeper
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -5656,6 +5919,10 @@ Graphs With Bounded Independence Number
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5695,7 +5962,10 @@ at most
 .
 \end_layout
 
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -5728,7 +5998,10 @@ for approximating the shortest path in graphs with independence number at
 
 \end_layout
 
-\begin_layout Separator
+\begin_layout Standard
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout
 
@@ -5810,6 +6083,10 @@ Is Party Unknown.
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5826,6 +6103,10 @@ Is Party Unknown.
 
 \begin_layout Corollary
 For undirected graphs, we can solve
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5961,6 +6242,10 @@ The Approximation Scheme is Optimal
 \end_inset
 
 
+\begin_inset Separator parbreak
+\end_inset
+
+
 \end_layout
 
 \begin_deeper
@@ -5982,6 +6267,9 @@ Suppose there exists an approximation scheme for
 \end_layout
 
 \begin_layout Proof
+\begin_inset Separator parbreak
+\end_inset
+
 
 \end_layout