\documentclass[oneside,final,12pt]{book}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}

\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}

\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{english}
\setotherlanguage{hebrew}
%%\setmainfont[Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}

\begin{center}
\vspace*{\baselineskip}

{\Large Department of Mathematics, BGU}

\vspace*{\baselineskip}

\rule{\textwidth}{1.6pt}\vspace*{-\baselineskip}\vspace*{2pt}
\rule{\textwidth}{0.4pt}\\[\baselineskip]

{\Huge Combinatorics Seminar}\\[0.2\baselineskip]

\rule{\textwidth}{0.4pt}\vspace*{-\baselineskip}\vspace{3.2pt}
\rule{\textwidth}{1.6pt}\\[\baselineskip]

\textbf{On} \emph{Tuesday, November 13, 2018}
\bigskip

\textbf{At} \emph{16:10 -- 17:10}
\bigskip

\textbf{In} \emph{201}

\vspace*{2\baselineskip}

{\large\scshape Roman Glebov 
  %
  (BGU)
}
\bigskip

will talk about
\bigskip

{\Large\bfseries Finitely Forcible Graphons\par}
\bigskip

\end{center}
\vfill

\textsc{Abstract:}
Abstract:
In extremal graph theory, we often consider large graphs that are in
the limit uniquely determined by finitely many densities of their
subgraphs. The corresponding limits (so-called graphons) are called
finitely forcible. Motivated by classical results in extremal
combinatorics as well as by recent developments in the study of
finitely forcible graphons, Lovasz and Szegedy made some conjectures
about the structure of such graphons. In particular, they conjectured
that the topological space of typical points of every finitely
forcible graphon is compact and finitely dimensional.
In joint results with D. Kral, T. Klimosova, and J. Volec, we could
disprove both conjectures.





\bigskip
\begin{center}
{\bfseries Please Note the Unusual Time and Place!}
\end{center}



% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex:
